{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T12:09:33Z","timestamp":1712318973088},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T00:00:00Z","timestamp":1181088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2007,11,1]]},"DOI":"10.1007\/s10898-007-9161-1","type":"journal-article","created":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T12:53:15Z","timestamp":1181047995000},"page":"609-622","source":"Crossref","is-referenced-by-count":15,"title":["The spherical constraint in Boolean quadratic programs"],"prefix":"10.1007","volume":"39","author":[{"given":"J\u00e9r\u00f4me","family":"Malick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,6]]},"reference":[{"key":"9161_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0166-218X(01)00266-9","volume":"119","author":"M. Anjos","year":"2002","unstructured":"Anjos M. and Wolkowicz H. (2002). Strenghened semidefinite relaxations via a second lifting for the max-cut problem. Discrete Appl. Math. 119: 79\u2013106","journal-title":"Discrete Appl. Math."},{"key":"9161_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-9859-3","volume-title":"Convex Analysis and Nonlinear Optimization","author":"J. Borwein","year":"2000","unstructured":"Borwein J. and Lewis A.S. (2000). Convex Analysis and Nonlinear Optimization. Springer Verlag, New York"},{"key":"9161_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S. Burer","year":"2003","unstructured":"Burer S. and Monteiro R.D.C. (2003). A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. (Series B) 95: 329\u2013357","journal-title":"Math. Program. (Series B)"},{"key":"9161_CR4","unstructured":"Beltran-Royo, C., Vial, J.Ph., Alonso-Ayuso, A.: Solving the uncapacitated facility location problem with semi-lagrangian relaxation. Available on optimization-on-line (2007)"},{"key":"9161_CR5","unstructured":"Bazaraa, M., Sherali, H., Shetty, C.M.: Nonlinear Programming, Theory and Algorithms, 2nd ed. John Wiley & Sons (1993)"},{"key":"9161_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Tal, R., Nemirovski, A.: Lectures on Modern Convex Optimization. MPS-SIAM Series on Optimization. Siam Publications (2001)","DOI":"10.1137\/1.9780898718829"},{"issue":"2","key":"9161_CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10589-006-6513-6","volume":"35","author":"C. Beltran","year":"2006","unstructured":"Beltran C., Tadonki C. and Vial J.Ph. (2006). Solving the p-median problem with a semi-lagrangian relaxation. Comput. Opt. Appl. 35(2): 239\u2013260","journal-title":"Comput. Opt. Appl."},{"key":"9161_CR8","doi-asserted-by":"crossref","unstructured":"Ekeland, I., Temam, R.: Convex Analysis and Variational Problems. North Holland (1976); reprinted by SIAM (1999)","DOI":"10.1137\/1.9781611971088"},{"key":"9161_CR9","unstructured":"Fletcher, R.: Practical Methods of Optimization. John Wiley & Sons, Chichester (second edition) (1987)"},{"key":"9161_CR10","doi-asserted-by":"crossref","unstructured":"Goemans, M., Rendl, F.: Combinatorial optimization. In: Wolkovicz, H., Saigal, R., Vandenberghe, L. (ed.) Handbook on Semidefinite Programming. Theory, Algorithms and Applications. Kluwer (2000)","DOI":"10.1007\/978-1-4615-4381-7_12"},{"key":"9161_CR11","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"6","author":"M.X. Goemans","year":"1995","unstructured":"Goemans M.X. and Williamson D.P. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 6: 1115\u20131145","journal-title":"J. ACM"},{"issue":"3","key":"9161_CR12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1093\/imanum\/22.3.329","volume":"22","author":"N. Higham","year":"2002","unstructured":"Higham N. (2002). Computing a nearest symmetric correlation matrix \u2013 a problem from finance. IMA J. Num. Anal. 22(3): 329\u2013343","journal-title":"IMA J. Num. Anal."},{"key":"9161_CR13","unstructured":"Horn, R.A., Johnson, Ch.R.: Matrix Analysis. Cambridge University Press (1989) (New edition, 1999)"},{"key":"9161_CR14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10589-005-3062-3","volume":"33","author":"H. Huang","year":"2006","unstructured":"Huang H., Pardalos P. and Prokopyev O. (2006). Lower bound improvement and forcing rule for quadratic binary programming. Comput. Opt. Appl. 33: 187\u2013208","journal-title":"Comput. Opt. Appl."},{"key":"9161_CR15","doi-asserted-by":"crossref","unstructured":"Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Kluwer Academic Publisher (2000)","DOI":"10.1007\/978-1-4615-0015-5"},{"issue":"3","key":"9161_CR16","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg C. and Rendl F. (2000). A spectral bundle method for semidefinite programming. SIAM J. Opt. 10(3): 673\u2013696","journal-title":"SIAM J. Opt."},{"key":"9161_CR17","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal C.: Convex Analysis and Minimization Algorithms. Springer Verlag, Heidelberg (1993) Two volumes","DOI":"10.1007\/978-3-662-02796-7"},{"key":"9161_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of Convex Analysis","author":"J.-B. Hiriart-Urruty","year":"2001","unstructured":"Hiriart-Urruty J.-B. and Lemar\u00e9chal C. (2001). Fundamentals of Convex Analysis. Springer Verlag, Heidelberg"},{"key":"9161_CR19","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computation","author":"R.M. Karp","year":"1972","unstructured":"Karp R.M. (1972). Reducibility among combinatorial problems. In: Miller, R.E. and Thatcher, J.W. (eds) Complexity of Computer Computation, pp 85\u2013103. Plenum Press, New York"},{"issue":"2","key":"9161_CR20","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/moor.27.2.347.322","volume":"27","author":"J.-B. Lasserre","year":"2002","unstructured":"Lasserre J.-B. (2002). Semidefinite programming vs. LP relaxation for polynomial programming. Math. Operat. Res. 27(2): 347\u2013360","journal-title":"Math. Operat. Res."},{"issue":"3","key":"9161_CR21","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M. Laurent","year":"2003","unstructured":"Laurent M. (2003). A comparison of the Sherali-Adams, Lovasz-Schrijver and Lasserre relaxations for 0-1 programming. Math. Operat. Res. 28(3): 470\u2013496","journal-title":"Math. Operat. Res."},{"key":"9161_CR22","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/3-540-45586-8_4","volume-title":"Computational Combinatorial Optimization","author":"C.\u00a0 Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal C.\u00a0 (2001). Lagrangian relaxation. In: J\u00fcnger, M. and Naddef, D. (eds) Computational Combinatorial Optimization, pp 112\u2013156. Springer Verlag, Heidelberg"},{"key":"9161_CR23","unstructured":"Lemar\u00e9chal, C., Oustry, F.: Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization. Rapport de Recherche 3710, INRIA (1999)"},{"key":"9161_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L. (1979). On the Shannon capacity of a graph. IEEE Trans. Inform. Theor. IT 25: 1\u20137","journal-title":"IEEE Trans. Inform. Theor. IT"},{"issue":"1","key":"9161_CR25","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0895479802413856","volume":"26","author":"J. Malick","year":"2004","unstructured":"Malick J. (2004). A dual approach to semidefinite least-squares problems. SIAM J. Matrix Anal. Appl. 26(1): 272\u2013284","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"9161_CR26","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0718039","volume":"18","author":"O.L. Mangasarian","year":"1981","unstructured":"Mangasarian O.L. (1981). Iterative solution of linear programs. SIAM J. Numer. Anal. 18(4): 606\u2013614","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"9161_CR27","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","volume":"26","author":"R.D. McBridge","year":"1980","unstructured":"McBridge R.D. and Yormark J.S. (1980). An implicit enumeration algorithm for quadratic integer programming. Manage. Sci. 26(3): 282\u2013296","journal-title":"Manage. Sci."},{"key":"9161_CR28","doi-asserted-by":"crossref","unstructured":"Nesterov, Yu., Wolkowicz, H., Ye, Y.: Semidefinite programming relaxations of nonconvex quadratic optimization. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Hanbook on Semidefinite Programming. Theory, Algorithms and Applications. Kluwer (2000)","DOI":"10.1007\/978-1-4615-4381-7_13"},{"key":"9161_CR29","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-004-0529-4","volume":"101","author":"P. Pardalos","year":"2004","unstructured":"Pardalos P., Iasemidis L.D., Sackellares J.C., Chaovalitwongse W., Carney P., Prokopyev O., Yatsenko V. and Shiau D.-S. (2004). Seizure warning algorithm based on optimization and nonlinear dynamics. Math. Program. 101: 365\u2013385","journal-title":"Program."},{"key":"9161_CR30","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S. Poljak","year":"1995","unstructured":"Poljak S., Rendl F. and Wolkowicz H. (1995). A recipe for semidefinite relaxation for (0,1)-quadratic programming. J. Global Opt. 7: 51\u201373","journal-title":"J. Global Opt."},{"key":"9161_CR31","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1137\/050624509","volume":"28","author":"H. Qi","year":"2006","unstructured":"Qi H. and Sun D. (2006). Quadratic convergence and numerical experiments of Newton\u2019s method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28: 360\u2013385","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9161_CR32","unstructured":"Scilab Consortium. http:\/\/www.scilab.org"},{"key":"9161_CR33","unstructured":"Saigal, R., Vandenberghe, L., Wolkowicz, H.: Handbook of Semidefinite-Programming. Kluwer (2000)"},{"issue":"2","key":"9161_CR34","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01580588","volume":"34","author":"P.W. Smith","year":"1986","unstructured":"Smith P.W. and Wolcowicz H. (1986). A nonlinear equation for linear programming. Math. Program. 34(2): 235\u2013238","journal-title":"Math. Program."},{"key":"9161_CR35","unstructured":"Takouda, P.L.: Probl\u00e8mes d\u2019approximation matricielle lin\u00e9aires coniques: Approches par projections et via Optimisation sous contraintes de semid\u00e9finie positivit\u00e9. PhD thesis, Universit\u00e9 Paul Sabatier\u2013Toulouse III (2003)"},{"key":"9161_CR36","unstructured":"Tutuncu, R.H., Toh, K.C., Todd, M.J.: Inexact primal-dual path-following algorithms for a special class of convex quadratic SDP and related problems. (Submitted) (2005)"},{"key":"9161_CR37","first-page":"250","volume":"34","author":"H. Wolkowicz","year":"1980","unstructured":"Wolkowicz H. and Styan G.P.H. (1980). A history of Samuelson\u2019s inequality. Amer. Statist. 34: 250","journal-title":"Amer. Statist."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9161-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-007-9161-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9161-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:12:08Z","timestamp":1559304728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-007-9161-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,6]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11,1]]}},"alternative-id":["9161"],"URL":"https:\/\/doi.org\/10.1007\/s10898-007-9161-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,6]]}}}