{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T12:54:28Z","timestamp":1667220868860},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T00:00:00Z","timestamp":1518739200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10898-018-0617-2","type":"journal-article","created":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T04:08:43Z","timestamp":1518754123000},"page":"313-339","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization"],"prefix":"10.1007","volume":"71","author":[{"given":"Shinji","family":"Yamada","sequence":"first","affiliation":[]},{"given":"Akiko","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,16]]},"reference":[{"key":"617_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/16M1058200","volume":"27","author":"S Adachi","year":"2017","unstructured":"Adachi, S., Iwata, S., Nakatsukasa, Y., Takeda, A.: Solving the trust region subproblem by a generalized eigenvalue problem. SIAM J. Optim. 27, 269\u2013291 (2017)","journal-title":"SIAM J. Optim."},{"key":"617_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01099462","volume":"6","author":"FA Al-Khayyal","year":"1995","unstructured":"Al-Khayyal, F.A., Larsen, C., Voorhis, T.V.: A relaxation method for nonconvex quadratically constrained quadratic programs. J. Global Optim. 6, 215\u2013230 (1995)","journal-title":"J. Global Optim."},{"key":"617_CR3","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43, 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"key":"617_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pac. J. Math. 16, 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"key":"617_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"C Audet","year":"2000","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Program. 87, 131\u2013152 (2000)","journal-title":"Math. Program."},{"key":"617_CR6","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s11590-013-0647-0","volume":"8","author":"L Bai","year":"2014","unstructured":"Bai, L., Mitchell, J.E., Pang, J.S.: Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints. Optim. Lett. 8, 811\u2013822 (2014)","journal-title":"Optim. Lett."},{"key":"617_CR7","volume-title":"Convex Optimization","author":"S Boyd","year":"2010","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2010)"},{"key":"617_CR8","volume-title":"Subgradient Methods. Lecture Notes of EE392o, Autumn Quarter","author":"S Boyd","year":"2003","unstructured":"Boyd, S., Xiao, L., Mutapcic, A.: Subgradient Methods. Lecture Notes of EE392o, Autumn Quarter. Stanford University, Stanford (2003)"},{"key":"617_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10589-013-9618-8","volume":"59","author":"S Burer","year":"2014","unstructured":"Burer, S., Kim, S., Kojima, M.: Faster, but weaker, relaxations for quadratically constrained quadratic programs. Comput. Optim. Appl. 59, 27\u201345 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"617_CR10","unstructured":"Chen, Y., Ye, X.: Projection onto a simplex (2011), \n                    ArXiv:1101.6081v2\n                    \n                  . Accessed 17 May 2016"},{"key":"617_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/A:1008282830093","volume":"10","author":"T Fujie","year":"1997","unstructured":"Fujie, T., Kojima, M.: Semidefinite programming relaxation for nonconvex quadratic programs. J. Global Optim. 10, 367\u2013380 (1997)","journal-title":"J. Global Optim."},{"key":"617_CR12","first-page":"143","volume":"79","author":"MX Goemans","year":"1997","unstructured":"Goemans, M.X.: Semidefinite programming in combinatorial optimization. Math. Program. 79, 143\u2013161 (1997)","journal-title":"Math. Program."},{"key":"617_CR13","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42, 1115\u20131145 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"key":"617_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2014.05.017","volume":"240","author":"Y Hu","year":"2015","unstructured":"Hu, Y., Yang, X., Sim, C.: Inexact subgradient methods for quasi-convex optimization problems. Eur. J. Oper. Res. 240, 315\u2013327 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"617_CR15","first-page":"711","volume":"17","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Yu, C., Li, C.: Stochastic subgradient method for quasi-convex optimization problems. J. Nonlinear Convex Anal. 17, 711\u2013724 (2016)","journal-title":"J. Nonlinear Convex Anal."},{"key":"617_CR16","unstructured":"Jiang, R., Li, D.: Convex relaxations with second order cone constraints for nonconvex quadratically constrained quadratic programming (2016). \n                    ArXiv:1608.02096v1\n                    \n                  . Accessed 8 Dec 2016"},{"key":"617_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1080\/10556780108805819","volume":"15","author":"S Kim","year":"2001","unstructured":"Kim, S., Kojima, M.: Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim. Methods Softw. 15, 201\u2013224 (2001)","journal-title":"Optim. Methods Softw."},{"key":"617_CR18","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1137\/100793955","volume":"21","author":"C Lu","year":"2011","unstructured":"Lu, C., Fang, S., Jin, Q., Wang, Z., Xing, W.: KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems. SIAM J. Optim. 21, 1475\u20131490 (2011)","journal-title":"SIAM J. Optim."},{"key":"617_CR19","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"ZQ Luo","year":"2010","unstructured":"Luo, Z.Q., Ma, W.K., So, A.M.C., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27, 20\u201334 (2010)","journal-title":"IEEE Signal Process. Mag."},{"key":"617_CR20","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"617_CR21","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, Berlin (2006)"},{"key":"617_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1023\/A:1026596100403","volume":"18","author":"I Novak","year":"2000","unstructured":"Novak, I.: Dual bounds and optimality cuts for all-quadratic programs with convex constraints. J. Global Optim. 18, 337\u2013356 (2000)","journal-title":"J. Global Optim."},{"key":"617_CR23","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Global Optim. 1, 15\u201322 (1991)","journal-title":"J. Global Optim."},{"key":"617_CR24","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. Ser. A 121, 307\u2013335 (2010)","journal-title":"Math. Program. Ser. A"},{"key":"617_CR25","unstructured":"SeDuMi optimization over symmetric cones. \n                    http:\/\/sedumi.ie.lehigh.edu\/"},{"key":"617_CR26","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"HD Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.P.: Enhancing RLT relaxation via a new class of semidefinite cuts. J. Global Optim. 22, 233\u2013261 (2002)","journal-title":"J. Global Optim."},{"key":"617_CR27","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1287\/moor.28.2.246.14485","volume":"28","author":"JF Sturm","year":"2003","unstructured":"Sturm, J.F., Zhang, S.: On cones of nonnegative quadratic functions. Math. Oper. Res. 28, 246\u2013267 (2003)","journal-title":"Math. Oper. Res."},{"key":"617_CR28","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10898-004-1947-9","volume":"32","author":"H Tuy","year":"2005","unstructured":"Tuy, H.: On solving nonconvex optimization problems by reducing the duality gap. J. Global Optim. 32, 349\u2013365 (2005)","journal-title":"J. Global Optim."},{"key":"617_CR29","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"617_CR30","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/A:1020383700229","volume":"24","author":"TV Voorhis","year":"2002","unstructured":"Voorhis, T.V.: A global optimization algorithm using Lagrangian underestimates and the interval newton method. J. Global Optim. 24, 349\u2013370 (2002)","journal-title":"J. Global Optim."},{"key":"617_CR31","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-011-0466-y","volume":"129","author":"XJ Zheng","year":"2011","unstructured":"Zheng, X.J., Sun, X.L., Li, D.: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation. Math. Program. 129, 301\u2013329 (2011)","journal-title":"Math. Program."},{"key":"617_CR32","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s10898-010-9630-9","volume":"50","author":"XJ Zheng","year":"2011","unstructured":"Zheng, X.J., Sun, X.L., Li, D.: Nonconvex quadratically constrained quadratic programming: best D.C.decompositions and their SDP representations. J. Global Optim. 50, 695\u2013712 (2011)","journal-title":"J. Global Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0617-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0617-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0617-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T02:21:05Z","timestamp":1550370065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0617-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,16]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["617"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0617-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,16]]},"assertion":[{"value":"31 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}