{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T10:30:41Z","timestamp":1750156241929},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,10,4]],"date-time":"2016-10-04T00:00:00Z","timestamp":1475539200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Research Foundation of Korea (KR)","award":["2014-R1A2A1A11049618"],"award-info":[{"award-number":["2014-R1A2A1A11049618"]}]},{"name":"Grant-in-Aid for Scientific Research","award":["(A) 26242027"],"award-info":[{"award-number":["(A) 26242027"]}]},{"name":"Ministry of education (SG)","award":["R-146-000-194-112"],"award-info":[{"award-number":["R-146-000-194-112"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10589-016-9879-0","type":"journal-article","created":{"date-parts":[[2016,10,4]],"date-time":"2016-10-04T01:32:16Z","timestamp":1475544736000},"page":"453-479","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A robust Lagrangian-DNN method for a class of quadratic optimization problems"],"prefix":"10.1007","volume":"66","author":[{"given":"Naohiko","family":"Arima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunyoung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masakazu","family":"Kojima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,4]]},"reference":[{"issue":"4","key":"9879_CR1","doi-asserted-by":"crossref","first-page":"2320","DOI":"10.1137\/120890636","volume":"23","author":"N Arima","year":"2013","unstructured":"Arima, N., Kim, S., Kojima, M.: A quadratically constrained quadratic optimization model for completely positive cone programming. SIAM J. Optim. 23(4), 2320\u20132340 (2013)","journal-title":"SIAM J. Optim."},{"key":"9879_CR2","first-page":"437","volume":"10","author":"N Arima","year":"2014","unstructured":"Arima, N., Kim, S., Kojima, M.: Simplified copositive and lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables. Pac. J. Optim. 10, 437\u2013451 (2014)","journal-title":"Pac. J. Optim."},{"key":"9879_CR3","unstructured":"Arima, N., Kim, S., Kojima, M., Toh, K.C.: Lagrangian-conic relaxations, part I: a unified framework and its applications to quadratic optimization problems. Research report B-475, Tokyo Institute of Technology, Department of Mathematical and Computing Sciences, Tokyo (2014)"},{"key":"9879_CR4","unstructured":"Arima, N., Kim, S., Kojima, M., Toh, K.C.: Lagrangian-conic relaxations, part II: Applications to polynomial optimization problems. Research report B-476, Tokyo Institute of Technology, Department of Mathematical and Computing Sciences, Oh-Okayama, Meguro-ku, Tokyo 152-8552 (2014)"},{"key":"9879_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., M, T.: A fast iterative shrinkage-thresholding algorithm for Linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"9879_CR6","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B Borcher","year":"1999","unstructured":"Borcher, B.: CSDP, a C library for semidefinite programming. Optim. Methods Softw. 11, 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9879_CR7","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous non-convex quadratic programs. Math. Program. 120, 479\u2013495 (2009)","journal-title":"Math. Program."},{"key":"9879_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-010-0010-8","volume":"2","author":"S Burer","year":"2010","unstructured":"Burer, S.: Optimizatin a polyhedral-semidefinite relaxation of completely positive programs. Math. Prog. Comp. 2, 1\u201319 (2010)","journal-title":"Math. Prog. Comp."},{"key":"9879_CR9","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E Klerk de","year":"2002","unstructured":"de Klerk, E., Pasechnik, D.V.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"9879_CR10","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/110853996","volume":"34","author":"M Fazel","year":"2013","unstructured":"Fazel, M., Pong, T.K., Sun, D.F., Tseng, P.: Hankel matrix rank minimization with applications to system identification and realization. SIAM J. Matrix Anal. Appl. 34, 946\u2013977 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9879_CR11","unstructured":"Fujisawa, K., Fukuda, M., Kobayashi, M., Kojima, M., Nakata, K., Nakata, M., M., Y.: SDPA (SemiDefinite Programming Algorithm) user\u2019s manual\u2014version 7.0.5. Research report B-448, Deptartment of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo (2008)"},{"key":"9879_CR12","unstructured":"Ge, D., Ye, Y.: On doubly positive semidefinite programming relaxations. http:\/\/www.optimization-online.org\/DB_HTML\/2010\/08\/2709.html (2010)"},{"key":"9879_CR13","unstructured":"Hahn, P., Anjos, M.: QAPLIB\u2014a quadratic assignment problem library. http:\/\/www.seas.upenn.edu\/qaplib"},{"key":"9879_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10107-015-0874-5","volume":"156","author":"S Kim","year":"2016","unstructured":"Kim, S., Kojima, M., Toh, K.C.: A lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. Math. Program. 156, 161\u2013187 (2016)","journal-title":"Math. Program."},{"key":"9879_CR15","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problems of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"9879_CR16","first-page":"238","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"Moreau, J.J.: D\u00e9composition orthogonale d\u2019un espace hilbertien selon deux cones mutuellement polaires. CR Acad. Sci. 255, 238\u2013240 (1962)","journal-title":"CR Acad. Sci."},{"key":"9879_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some np-complete problems in quadratic and non-linear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"9879_CR18","unstructured":"Sloane, N.: Challenge problems: Independent sets in graphs. http:\/\/neilsloane.com\/doc\/graphs.html"},{"key":"9879_CR19","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11&12","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11&12, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9879_CR20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003)","journal-title":"Math. Program."},{"key":"9879_CR21","unstructured":"Wiegele, A.: Biq mac library. http:\/\/www.biqmac.uni-klu.ac.at\/biqmaclib.html (2007)"},{"key":"9879_CR22","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"LQ Yang","year":"2015","unstructured":"Yang, L.Q., Sun, D.F., Toh, K.C.: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Prog. Comp. 7, 331\u2013366 (2015)","journal-title":"Math. Prog. Comp."},{"key":"9879_CR23","doi-asserted-by":"crossref","unstructured":"Yoshise, A., Matsukawa, Y.: On optimization over the doubly nonnegative cone. In: IEEE multi-conference on systems and control (2010)","DOI":"10.1109\/CACSD.2010.5612811"},{"issue":"4","key":"9879_CR24","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D.F., Toh, K.C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9879-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9879-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9879-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T00:17:15Z","timestamp":1498349835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9879-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,4]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9879"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9879-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,4]]}}}