{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T01:07:18Z","timestamp":1776474438373,"version":"3.51.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1023\/a:1014834318702","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T16:20:03Z","timestamp":1041092403000},"page":"49-79","source":"Crossref","is-referenced-by-count":11,"title":["Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation"],"prefix":"10.1007","volume":"22","author":[{"given":"Samuel","family":"Burer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato D.C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"399772_CR1","volume-title":"Applications and Algorithms of Complementarity","author":"S. Benson","year":"2000","unstructured":"S. Benson and Y. Ye, \u201cApproximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation,\u201d in Applications and Algorithms of Complementarity, M. Ferris and J. Pang (Eds.), Kluwer: Norwell, MA, 2000."},{"key":"399772_CR2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S1052623497328008","volume":"10","author":"S. Benson","year":"2000","unstructured":"S. Benson, Y. Ye, and X. Zhang, \u201cSolving large-scale sparse semidefinite programs for combinatorial optimization,\u201d SIAM Journal on Optimization, vol. 10, pp. 443\u2013461, 2000.","journal-title":"SIAM Journal on Optimization"},{"key":"399772_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/10556780108805818","volume":"15","author":"S. Burer","year":"2001","unstructured":"S. Burer and R.D.C. Monteiro, \u201cA projected gradient algorithm for solving the maxcut SDP relaxation,\u201d Optimization Methods and Software, vol. 15, pp. 175\u2013200, 2001.","journal-title":"Optimization Methods and Software"},{"key":"399772_CR4","series-title":"Working paper","volume-title":"Mathematical Programming","author":"S. Burer","year":"2001","unstructured":"S. Burer and R.D.C. Monteiro, \u201cA nonlinear programming algorithm for solving semidefinite programs via low-rank factorization,\u201d Working paper, School of ISyE, Georgia Tech, USA, March 2001. Also in Mathematical Programming, to appear."},{"key":"399772_CR5","unstructured":"S. Burer, R.D.C. Monteiro, and Y. Zhang, \u201cSolving a class of semidefinite programs via nonlinear programming,\u201d Mathematical Programming A, to appear. See also Department of Computational and Applied Mathematics, Rice University, Houston, Texas 77005, USA, Technical Report TR99-17, September 1999."},{"key":"399772_CR6","volume-title":"Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems","author":"C. Choi","year":"2000","unstructured":"C. Choi and Y. Ye, \u201cApplication of semidefinite programming to circuit partitioning,\u201d in Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, P.M. Pardalos (Ed.), Kluwer: Norwell, MA, 2000."},{"key":"399772_CR7","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"M.X. Goemans and D.P. Williamson, \u201cImproved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,\u201d Journal of ACM, vol. 42, pp. 1115\u20131145, 1995.","journal-title":"Journal of ACM"},{"key":"399772_CR8","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"C. Helmberg and F. Rendl, \u201cA spectral bundle method for semidefinite programming,\u201d SIAM Journal on Optimization, vol. 10, pp. 673\u2013696, 2000.","journal-title":"SIAM Journal on Optimization"},{"key":"399772_CR9","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/026","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","author":"D. Johnson","year":"1996","unstructured":"D. Johnson and M. Trick, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, AMS: Providence, RI, 1996."},{"issue":"1","key":"399772_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"IT-25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz, \u201cOn the Shannon capacity of a graph,\u201d IEEE Transactions of Information Theory, vol. IT-25, no. 1, pp. 1\u20137, 1979.","journal-title":"IEEE Transactions of Information Theory"},{"key":"399772_CR11","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1137\/S1052623497318980","volume":"9","author":"R.D.C. Monteiro","year":"1999","unstructured":"R.D.C. Monteiro and J.S. Pang, \u201cA potential reduction Newton method for constrained equations,\u201d SIAM Journal on Optimization, vol. 9, pp. 729\u2013754, 1999.","journal-title":"SIAM Journal on Optimization"},{"key":"399772_CR12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1006\/jpdc.1997.1381","volume":"46","author":"M. Peinado","year":"1997","unstructured":"M. Peinado and S. Homer, \u201cDesign and performance of parallel and distributed approximation algorithms for maxcut,\u201d Journal of Parallel and Distributed Computing, vol. 46, pp. 48\u201361, 1997.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"399772_CR13","series-title":"Technical Report","volume-title":"On formulating semidefinite programming problems as smooth convex nonlinear optimization problems","author":"R.J. Vanderbei","year":"1999","unstructured":"R.J. Vanderbei and H. Yurttan Benson, \u201cOn formulating semidefinite programming problems as smooth convex nonlinear optimization problems,\u201d Dept. of Operations Research and Financial Engineering, Princeton University, Princeton NJ, Technical Report ORFE 99-01, November 1999."},{"key":"399772_CR14","unstructured":"S. Vavasis, \u201cA note on efficient computation of the gradient in semidefinite programming,\u201d Working paper, Department of Computer Science, Cornell University, September 1999."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014834318702.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014834318702\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014834318702.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:17:24Z","timestamp":1752376644000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014834318702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["399772"],"URL":"https:\/\/doi.org\/10.1023\/a:1014834318702","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}