{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:08:14Z","timestamp":1777388894285,"version":"3.51.4"},"reference-count":46,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0377-2217(01)00143-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:06:09Z","timestamp":1027577169000},"page":"461-482","source":"Crossref","is-referenced-by-count":61,"title":["Semidefinite programming"],"prefix":"10.1016","volume":"137","author":[{"given":"C.","family":"Helmberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0377-2217(01)00143-6_BIB1","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/S1052623496304700","article-title":"Primal\u2013dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results","volume":"8","author":"Alizadeh","year":"1998","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"10.1016\/S0377-2217(01)00143-6_BIB2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.2140\/pjm.1975.57.15","article-title":"Cones of diagonally dominant matrices","volume":"57","author":"Barker","year":"1975","journal-title":"Pacific Journal of Mathematics"},{"issue":"4","key":"10.1016\/S0377-2217(01)00143-6_BIB3","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1137\/S1052623495291951","article-title":"Robust truss topology design via semidefinite programming","volume":"7","author":"Ben-Tal","year":"1997","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"10.1016\/S0377-2217(01)00143-6_BIB4","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","article-title":"Robust convex optimization","volume":"23","author":"Ben-Tal","year":"1998","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(01)00143-6_BIB5","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S1052623497328008","article-title":"Solving large-scale sparse semidefinite programs for combinatorial optimization","volume":"10","author":"Benson","year":"2000","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"10.1016\/S0377-2217(01)00143-6_BIB6","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1287\/moor.23.4.806","article-title":"Sensitivity analysis of optimization problems under second order regular constraints","volume":"23","author":"Bonnans","year":"1998","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB7","doi-asserted-by":"crossref","unstructured":"S. Boyd, L. El Ghaoui, E. Feron, V. Balakrishnan, Linear matrix inequalities in system and control theory, SIAM Studies in Applied Mathematics, vol. 15, SIAM, Philadelphia, 1994","DOI":"10.1137\/1.9781611970777"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB8","unstructured":"S. Burer, R.D. Monteiro, Y. Zhang, Solving semidefinite programs via nonlinear programming, part I: Transformations and derivatives. Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, Sept. 1999"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0120698","article-title":"The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices","volume":"3","author":"Cullum","year":"1975","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(97)00011-4","article-title":"Initialization in semidefinite programming via a self-dual skew-symmetric embedding","volume":"20","author":"de Klerk","year":"1997","journal-title":"Operations Research Letters"},{"issue":"4","key":"10.1016\/S0377-2217(01)00143-6_BIB11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1006\/eujc.1993.1035","article-title":"Combinatorial properties and the complexity of a max-cut approximation","volume":"14","author":"Delorme","year":"1993","journal-title":"European Journal of Combinatorics"},{"issue":"1","key":"10.1016\/S0377-2217(01)00143-6_BIB12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02523688","article-title":"Improved approximation algorithms for MAX k-CUT and MAX BISECTION","volume":"18","author":"Frieze","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02614315","article-title":"Semidefinite programming in combinatorial optimization","volume":"79","author":"Goemans","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB14","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB15","series-title":"Matrix Computations","author":"Golub","year":"1989"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB16","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, A. Schrijver, Geometric algorithms and combinatorial optimization, in: Algorithms and Combinatorics, second ed., vol. 2, Springer, 1988","DOI":"10.1007\/978-3-642-97881-4"},{"issue":"3","key":"10.1016\/S0377-2217(01)00143-6_BIB17","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1137\/S089547989631442X","article-title":"Fixing variables in semidefinite relaxations","volume":"21","author":"Helmberg","year":"2000","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB18","doi-asserted-by":"crossref","unstructured":"C. Helmberg, K.C. Kiwiel, F. Rendl, Incorporating inequality constraints in the spectral bundle method, in: R.E. Bixby, E.A. Boyd, R.Z. R\u0131\u0301os-Mercado (Eds.), Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1412, Springer, Berlin, 1998, pp. 423\u2013435","DOI":"10.1007\/3-540-69346-7_32"},{"issue":"3","key":"10.1016\/S0377-2217(01)00143-6_BIB19","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","article-title":"A spectral bundle method for semidefinite programming","volume":"10","author":"Helmberg","year":"2000","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"10.1016\/S0377-2217(01)00143-6_BIB20","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","article-title":"An interior-point method for semidefinite programming","volume":"6","author":"Helmberg","year":"1996","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB21","series-title":"Matrix Analysis","author":"Horn","year":"1985"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB22","series-title":"Topics in Matrix Analysis","author":"Horn","year":"1991"},{"issue":"2","key":"10.1016\/S0377-2217(01)00143-6_BIB23","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/274787.274791","article-title":"Approximate graph coloring by semidefinite programming","volume":"45","author":"Karger","year":"1998","journal-title":"Journal of ACM"},{"issue":"2","key":"10.1016\/S0377-2217(01)00143-6_BIB24","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/PL00009496","article-title":"Integer optimization on convex semialgebraic sets","volume":"23","author":"Khachiyan","year":"2000","journal-title":"Discrete and Computational Geometry"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB25","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","article-title":"Proximity control in bundle methods for convex nondifferentiable minimization","volume":"46","author":"Kiwiel","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB26","first-page":"147","article-title":"Reduction of monotone linear complementarity problems over cones to linear programs over cones","volume":"22","author":"Kojima","year":"1997","journal-title":"Acta Mathematica Vietnamica"},{"issue":"1","key":"10.1016\/S0377-2217(01)00143-6_BIB27","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","article-title":"Interior-point methods for the monotone linear complementarity problem in symmetric matrices","volume":"7","author":"Kojima","year":"1997","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB28","doi-asserted-by":"crossref","unstructured":"A.S. Lewis, M.L. Overton, Eigenvalue optimization, Acta Numerica, 1996, 149\u2013190","DOI":"10.1017\/S0962492900002646"},{"issue":"2","key":"10.1016\/S0377-2217(01)00143-6_BIB29","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","article-title":"Cones of matrices and set-functions and 0\u20131 optimization","volume":"1","author":"Lov\u00e1sz","year":"1991","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"10.1016\/S0377-2217(01)00143-6_BIB30","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1137\/S1052623496308618","article-title":"Polynomial convergence of primal\u2013dual algorithms for semidefinite programming based on Monteiro and Zhang family of directions","volume":"8","author":"Monteiro","year":"1998","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB31","doi-asserted-by":"crossref","unstructured":"Y. Nesterov, A. Nemirovskii, Interior-point polynomial algorithms in convex programming, SIAM Studies in Applied Mathematics, Philadelphia, 1994","DOI":"10.1137\/1.9781611970791"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","article-title":"Self-scaled barriers and interior-point methods for convex programming","volume":"22","author":"Nesterov","year":"1997","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB33","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S1052623495290209","article-title":"Primal\u2013dual interior-point methods for self-scaled cones","volume":"8","author":"Nesterov","year":"1998","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"10.1016\/S0377-2217(01)00143-6_BIB34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00011388","article-title":"A second-order bundle method to minimize the maximum eigenvalue function","volume":"89","author":"Oustry","year":"2000","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/S0377-2217(01)00143-6_BIB35","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0802007","article-title":"Large-scale optimization of eigenvalues","volume":"2","author":"Overton","year":"1992","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"10.1016\/S0377-2217(01)00143-6_BIB36","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.23.2.339","article-title":"On the rank of extreme matrices in semidefinite programming and the multiplicity of optimal eigenvalues","volume":"23","author":"Pataki","year":"1998","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB37","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0005-1098(82)90087-5","article-title":"Nondifferentiable optimization algorithm for designing control systems having singular value inequalities","volume":"18","author":"Polak","year":"1982","journal-title":"Automatica"},{"issue":"4","key":"10.1016\/S0377-2217(01)00143-6_BIB38","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1008203903341","article-title":"On the complexity of semidefinite programs","volume":"10","author":"Porkolab","year":"1997","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"10.1016\/S0377-2217(01)00143-6_BIB39","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02614433","article-title":"An exact duality theory for semidefinite programming and its complexity implications","volume":"77","author":"Ramana","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB40","series-title":"Convex Analysis","author":"Rockafellar","year":"1970"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB41","first-page":"1","article-title":"Quadratic optimization problems","volume":"25","author":"Shor","year":"1987","journal-title":"Soviet Journal of Computer and Systems Sciences"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556789908805745","article-title":"A study of search directions in primal\u2013dual interior-point methods for semidefinite programming","volume":"11","author":"Todd","year":"1999","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"10.1016\/S0377-2217(01)00143-6_BIB43","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","article-title":"Semidefinite programming","volume":"38","author":"Vandenberghe","year":"1996","journal-title":"SIAM Review"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB44","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0024-3795(81)90143-9","article-title":"Some applications of optimization in matrix theory","volume":"40","author":"Wolkowicz","year":"1981","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/S0377-2217(01)00143-6_BIB45","doi-asserted-by":"crossref","unstructured":"H. Wolkowicz, R. Saigal, L. Vandenberghe (Eds.), Handbook of Semidefinite Programming, International Series in Operations Research and Management Science, vol. 27, Kluwer Academic Publishers, Dordrecht, 2000","DOI":"10.1007\/978-1-4615-4381-7"},{"issue":"2","key":"10.1016\/S0377-2217(01)00143-6_BIB46","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/S1052623495296115","article-title":"On extending some primal\u2013dual interior-point algorithms from linear programming to semidefinite programming","volume":"8","author":"Zhang","year":"1998","journal-title":"SIAM Journal on Optimization"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001436?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701001436?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:31:27Z","timestamp":1578429087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701001436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0377221701001436"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00143-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}