A Lagrangian-DNN Relaxation: a Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems Sunyoung Kim? , Masakazu Kojima† and Kim-Chuan Toh‡ October 2013 Abstract. We propose an effi

First Page		Document Content
Date: 2015-02-07 02:01:57		A Lagrangian-DNN Relaxation: a Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems Sunyoung Kim? , Masakazu Kojima† and Kim-Chuan Toh‡ October 2013 Abstract. We propose an effi Add to Reading List Source URL: www.math.nus.edu.sg Download Document from Source Website File Size: 419,27 KB Share Document on Facebook