{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:04Z","timestamp":1752378004438,"version":"3.41.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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,2]]},"DOI":"10.1023\/a:1013716917710","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T17:20:10Z","timestamp":1040664010000},"page":"201-212","source":"Crossref","is-referenced-by-count":7,"title":["Computational Experience with Ill-Posed Problems in Semidefinite Programming"],"prefix":"10.1007","volume":"21","author":[{"given":"Gerald","family":"Gruber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Rendl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"390826_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"F. Alizadeh, \u201cInterior point methods in semidefinite programming with applications to combinatorial optimization,\u201d SIAM Journal on Optimization, vol. 5, no. 1, pp. 13\u201351, 1995.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"390826_CR2","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F. Alizadeh","year":"1998","unstructured":"F. Alizadeh, J-P.A. Haeberly, and M.L. Overton, \u201cPrimal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results,\u201d SIAM Journal on Optimization, vol. 8, no. 3, pp. 746\u2013768, 1998.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"390826_CR3","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1090\/S0002-9904-1969-12153-1","volume":"75","author":"A. Ben-Israel","year":"1969","unstructured":"A. Ben-Israel, A. Charnes, and K. Kortanek, \u201cDuality and asymptotic solvability over cones,\u201d Bulletin of American Mathematical Society, vol. 75, no. 2, pp. 318\u2013324, 1969.","journal-title":"Bulletin of American Mathematical Society"},{"key":"390826_CR4","series-title":"American Mathematical Society","first-page":"215","volume-title":"Topics in Semidefinite and Interior-Point Methods","author":"E. de Klerk","year":"1998","unstructured":"E. de Klerk, C. Roos, and T. Terlaky, \u201cInfeasible-start semidefinite programming algorithms via self-dual embeddings,\u201d in Topics in Semidefinite and Interior-Point Methods. vol. 18: The Fields Institute for Research in Mathematical Sciences, Communications Series, Providence, Rhode Island, 1998. American Mathematical Society, pp. 215\u2013236."},{"key":"390826_CR5","doi-asserted-by":"crossref","unstructured":"M.X. Goemans and D.P. Williamson, \u201c.878-approximation algorithms for MAX CUT and MAX 2SAT,\u201d in Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 422\u2013431, Montr\u00e9al, Qu\u00e9bec, Canada, 1994, pp. 422\u2013431.","DOI":"10.1145\/195058.195216"},{"issue":"6","key":"390826_CR6","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 the ACM, vol. 42, no. 6, pp. 1115\u20131145, 1995. preliminary version, see [5].","journal-title":"Journal of the ACM"},{"key":"390826_CR7","isbn-type":"print","volume-title":"On Semidefinite Programming and Applications in Combinatorial Optimization","author":"G. Gruber","year":"2000","unstructured":"G. Gruber, \u201cOn Semidefinite Programming and Applications in Combinatorial Optimization,\u201d PhD Thesis, University of Technology, Graz, Austria, 2000. Shaker Verlag: Aachen\u2014Maastricht, ISBN 3-8265-7541-5.","ISBN":"https:\/\/id.crossref.org\/isbn\/3826575415"},{"issue":"2","key":"390826_CR8","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C. Helmberg","year":"1996","unstructured":"C. Helmberg, F. Rendl, R.J. Vanderbei, and H. Wolkowicz, \u201cAn interior point method for semidefinite programming,\u201d SIAM Journal on Optimization, vol. 6, no. 2, pp. 342\u2013361, 1996.","journal-title":"SIAM Journal on Optimization"},{"key":"390826_CR9","series-title":"Communications Series","first-page":"77","volume-title":"Topics in Semidefinite and Interior-Point Methods","author":"S.E. Karisch","year":"1998","unstructured":"S.E. Karisch and F. Rendl, \u201cSemidefinite programming and graph equipartition,\u201d in Topics in Semidefinite and Interior-Point Methods. vol. 18: The Fields Institute for Research in Mathematical Sciences, Communications Series, Providence, Rhode Island, 1998. American Mathematical Society, pp. 77\u201395."},{"issue":"1","key":"390826_CR10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M. Kojima","year":"1997","unstructured":"M. Kojima, S. Shindoh, and S. Hara, \u201cInterior point methods for the monotone linear complementarity problem in symmetric matrices,\u201d SIAM Journal on Optimization, vol. 7, no. 1, pp. 86\u2013125, 1997.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"390826_CR11","first-page":"636","volume":"7","author":"R.D.C. Monteiro","year":"1997","unstructured":"R.D.C. Monteiro, \u201cPrimal-dual path-following algorithms for semidefinite programming,\u201d SIAM Journal on Optimization, vol. 7, no. 3, pp. 636\u2013678, 1997.","journal-title":"SIAM Journal on Optimization"},{"key":"390826_CR12","volume-title":"Interior Point Polynomial Algorithms in Convex Programming","author":"Y. E. Nesterov","year":"1994","unstructured":"Yu. E. Nesterov and A.S. Nemirovskii, Interior Point Polynomial Algorithms in Convex Programming, SIAM Publications: SIAM, Philadelphia, USA, 1994."},{"issue":"2","key":"390826_CR13","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"Y. Nesterov","year":"1998","unstructured":"Yu.E. Nesterov and M.J. Todd, \u201cPrimal-dual interior-point methods for self-scaled cones,\u201d SIAM Journal on Optimization, vol. 8, no. 2, pp. 324\u2013364, 1998.","journal-title":"SIAM Journal on Optimization"},{"key":"390826_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0168-9274(98)00097-X","volume":"29","author":"F. Rendl","year":"1999","unstructured":"F. Rendl, \u201cSemidefinite programming and combinatorial optimization,\u201d Applied Numerical Mathematics, vol. 29, pp. 255\u2013281, 1999.","journal-title":"Applied Numerical Mathematics"},{"key":"390826_CR15","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J.F. Sturm","year":"1999","unstructured":"J.F. Sturm, \u201cUsing SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones,\u201d Optimization Methods and Software, vol. 11, pp. 625\u2013653, 1999.","journal-title":"Optimization Methods and Software"},{"key":"390826_CR16","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"K.C. Toh","year":"1999","unstructured":"K.C. Toh, M.J. Todd, and R. Tutuncu, \u201cSDPT3\u2014a matlab software package for semidefinite programming,\u201d Optimization Methods and Software, vol. 11, pp. 545\u2013581, 1999.","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"390826_CR17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"L. Vandenberghe and S. Boyd, \u201cSemidefinite programming,\u201d SIAM Review, vol. 38, no. 1, pp. 49\u201395, 1996.","journal-title":"SIAM Review"},{"key":"390826_CR18","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S.J. Wright","year":"1997","unstructured":"S.J. Wright, Primal-Dual Interior-Point Methods, Society for Industrial and Applied Mathematics: 3600 University City Science Center, Philadelphia, 1997."},{"key":"390826_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q. Zhao","year":"1998","unstructured":"Q. Zhao, S.E. Karisch, F. Rendl, and H. Wolkowicz, \u201cSemidefinite programming relaxations for the quadratic assignment problem,\u201d Journal of Combinatorial Optimization, vol. 2, no. 1, pp. 71\u2013109, 1998.","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013716917710.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013716917710\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013716917710.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:14:43Z","timestamp":1752376483000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013716917710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["390826"],"URL":"https:\/\/doi.org\/10.1023\/a:1013716917710","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}