{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:12:50Z","timestamp":1758816770268},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T00:00:00Z","timestamp":1356652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10107-012-0628-6","type":"journal-article","created":{"date-parts":[[2012,12,27]],"date-time":"2012-12-27T04:30:01Z","timestamp":1356582601000},"page":"99-124","source":"Crossref","is-referenced-by-count":14,"title":["On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0\u20131 quadratic problems leading to quasi-Newton methods"],"prefix":"10.1007","volume":"140","author":[{"given":"J\u00e9r\u00f4me","family":"Malick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Roupin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,28]]},"reference":[{"key":"628_CR1","doi-asserted-by":"crossref","unstructured":"Anjos, M., Lasserre, J.B.: Handbook of Semidefinite, Conic and Polynomial Optimization. In: International Series in Operations Research & Management Science, Vol. 166. Springer (2012)","DOI":"10.1007\/978-1-4614-0769-0"},{"issue":"1","key":"628_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math. Program. 109(1), 55\u201368 (2007)","journal-title":"Math. Program."},{"issue":"6","key":"628_CR3","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A Billionnet","year":"2009","unstructured":"Billionnet, A., Elloumi, S., Plateau, M.-C.: Improving the performance of standard solvers for quadratic 0\u20131 programs by a tight convex reformulation: the QCR method. Discret. Appl. Math. 157(6), 1185\u20131197 (2009)","journal-title":"Discret. Appl. Math."},{"key":"628_CR4","doi-asserted-by":"crossref","unstructured":"Bonnans, J.F., Gilbert, J.Ch., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.: Numerical Optimization. Springer, Berlin (2003)","DOI":"10.1007\/978-3-662-05078-1"},{"issue":"3","key":"628_CR5","first-page":"171","volume":"43","author":"A Billionnet","year":"2005","unstructured":"Billionnet, A.: Different formulations for solving the heaviest k-subgraph problem. Inf. Syst. Oper. Res. 43(3), 171\u2013186 (2005)","journal-title":"Inf. Syst. Oper. Res."},{"issue":"1","key":"628_CR6","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: CSDP, a C library for semidefinite programming. Optim. Methods Softw. 11(1), 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"key":"628_CR7","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"628_CR8","doi-asserted-by":"crossref","unstructured":"de Klerk, E., Sotirov, R.: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Prog. 122(2) (2010)","DOI":"10.1007\/s10107-008-0246-5"},{"issue":"1","key":"628_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10288-006-0011-7","volume":"5","author":"A Faye","year":"2007","unstructured":"Faye, A., Roupin, F.: Partial lagrangian for general quadratic programming. 4\u2019OR A Q. J. Oper. Res. 5(1), 75\u201388 (2007)","journal-title":"4\u2019OR A Q. J. Oper. Res."},{"key":"628_CR10","doi-asserted-by":"crossref","unstructured":"Gilbert, J.Ch., Lemar\u00e9chal, C.: Some numerical experiments with variable-storage quasi-Newton algorithms. Math. Program. 45, 407\u2013435 (1989)","DOI":"10.1007\/BF01589113"},{"key":"628_CR11","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"6","author":"M Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 6, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"628_CR12","unstructured":"Helmberg, C.: Semidefinite Programming for Combinatorial Optimization. PhD thesis, Habilitationsschrift, TU Berlin (2000)"},{"key":"628_CR13","unstructured":"Helmberg. C.: A C++ Implementation of the Spectral Bundle Method, Version 1.1.3. http:\/\/www-user.tu-chemnitz.de\/~helmberg\/SBmethod\/ (2004)"},{"key":"628_CR14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(88)90223-6","volume":"103","author":"N Higham","year":"1988","unstructured":"Higham, N.: Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl 103, 103\u2013118 (1988)","journal-title":"Linear Algebra Appl"},{"key":"628_CR15","doi-asserted-by":"crossref","unstructured":"Helmberg, C., Poljak, S., Rendl, F., Wolkowicz, H.: Combining semidefinite and polyhedral relaxations for integer programs. In: Balas, E., Clausen, J. (eds.) IPCO, Volume 920 of Lecture Notes in Computer Science, pp. 124\u2013134. Springer (1995)","DOI":"10.1007\/3-540-59408-6_46"},{"issue":"3","key":"628_CR16","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"628_CR17","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior point method for semidefinite programming. SIAM J. Optim. 6, 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"key":"628_CR18","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Two volumes. Springer, Heidelberg (1993)","DOI":"10.1007\/978-3-662-02796-7"},{"issue":"1","key":"628_CR19","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/080713380","volume":"20","author":"S Kim","year":"2009","unstructured":"Kim, S., Kojima, M., Waki, H.: Exploiting sparsity in sdp relaxation for sensor network localization. SIAM J. Optim. 20(1), 192\u2013215 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"628_CR20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/ijoc.12.3.177.12637","volume":"12","author":"S Karisch","year":"2000","unstructured":"Karisch, S., Rendl, F., Clausen, J.: Solving graph bisection problems with semidefinite programming. INFORMS J Comput. 12(3), 177\u2013191 (2000)","journal-title":"INFORMS J Comput."},{"key":"628_CR21","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C.: Lagrangian relaxation. In: Junger, M., Naddef, D. (eds.) Computational Combinatorial Optimization, pp. 112\u2013156. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-45586-8_4"},{"key":"628_CR22","unstructured":"Lemar\u00e9chal, C., Oustry, F.: Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization. Rapport de Recherche 3710, INRIA (1999)"},{"issue":"2","key":"628_CR23","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"628_CR24","doi-asserted-by":"crossref","unstructured":"Malick, J.: Spherical constraint in Boolean quadratic programming. J. Glob. Optim. 39(4) (2007)","DOI":"10.1007\/s10898-007-9161-1"},{"issue":"1","key":"628_CR25","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/070704575","volume":"20","author":"J Malick","year":"2009","unstructured":"Malick, J., Povh, J., Rendl, F., Wiegele, A.: Regularization methods for semidefinite programming. SIAM J. Optim. 20(1), 336\u2013356 (2009)","journal-title":"SIAM J. Optim."},{"key":"628_CR26","doi-asserted-by":"crossref","unstructured":"Malick, J., Roupin, F.: Numerical study of semidefinite bounds for the k-cluster problem. In: n ISCO\u201910, International Symposium on Combinatorial Optimization. Electronics Notes of Discrete Mathematics, pp. 399\u2013406. Elsevier (2010)","DOI":"10.1016\/j.endm.2010.05.051"},{"key":"628_CR27","doi-asserted-by":"crossref","unstructured":"Malick, J., Roupin, F.: Solving k-cluster problems to optimality with semidefinite programming. Math. Program. 136(2), 279\u2013300 (2012)","DOI":"10.1007\/s10107-012-0604-1"},{"key":"628_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"628_CR29","doi-asserted-by":"crossref","unstructured":"Pardalos, P.., Iasemidis, L.D, Sackellares, J.C., Chaovalitwongse, W., Carney, P., Prokopyev, O., Yatsenko, V., Shiau, D.-S.: Seizure warning algorithm based on optimization and nonlinear dynamics. Math. Program. 101:365\u2013385 (2004)","DOI":"10.1007\/s10107-004-0529-4"},{"key":"628_CR30","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF02247879","volume":"45","author":"P Pardalos","year":"1990","unstructured":"Pardalos, P., Rodgers, G.P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 134\u2013144 (1990)","journal-title":"Computing"},{"key":"628_CR31","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for (0,1)-quadratic programming. J. Glob. Optim. 7, 51\u201373 (1995)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"628_CR32","first-page":"353","volume":"58","author":"LQ Qi","year":"1993","unstructured":"Qi, L.Q., Sun, J.: A nonsmooth version of Newton\u2019s method. Math. Program. 58(3), 353\u2013367 (1993)","journal-title":"Math. Program."},{"issue":"4","key":"628_CR33","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s10878-004-4838-6","volume":"8","author":"F Roupin","year":"2004","unstructured":"Roupin, F.: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems. J. Comb. Optim. 8(4), 469\u2013493 (2004)","journal-title":"J. Comb. Optim."},{"key":"628_CR34","doi-asserted-by":"crossref","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 polyedral relaxations. Math. Program. 121, 307\u2013335 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"628_CR35","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discret. Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discret. Math."},{"key":"628_CR36","unstructured":"Saigal, R., Vandenberghe, L., Wolkowicz, H.: Handbook of Semidefinite Programming. Kluwer, Dordrecht (2000)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0628-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0628-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0628-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T16:12:47Z","timestamp":1562515967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0628-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,28]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["628"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0628-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,28]]}}}