Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
Document Date: 2015-02-07 02:01:57
Open Document
File Size: 419,27 KB
Share Result on Facebook
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