{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:09:36Z","timestamp":1761620976539},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T00:00:00Z","timestamp":1195516800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s10589-007-9141-x","type":"journal-article","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T14:22:24Z","timestamp":1195482144000},"page":"379-409","source":"Crossref","is-referenced-by-count":5,"title":["A second-order cone cutting surface method: complexity and application"],"prefix":"10.1007","volume":"43","author":[{"given":"Mohammad R.","family":"Oskoorouchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John E.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,20]]},"reference":[{"issue":"1","key":"9141_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F. Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95(1), 3\u201351 (2003)","journal-title":"Math. Program."},{"key":"9141_CR2","first-page":"1","volume":"69","author":"D.S. Atkinson","year":"1995","unstructured":"Atkinson, D.S., Vaidya, P.M.: A cutting plane algorithm that uses analytic centers. Math. Program. Ser.\u00a0B 69, 1\u201343 (1995)","journal-title":"Math. Program. Ser.\u00a0B"},{"key":"9141_CR3","unstructured":"Basescu, V.L., Mitchell, J.E.: An analytic center cutting plane approach for conic programming. Rensselaer Polytechnic Institute, Troy, NY 12180 (June 2005)"},{"key":"9141_CR4","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B. Borchers","year":"1999","unstructured":"Borchers, B.: SDPLIB 1.2, a library of semidefinite programming problems. Optim. Methods Softw. 11, 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9141_CR5","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1080\/10556780500286582","volume":"21","author":"S. Burer","year":"2006","unstructured":"Burer, S., Choi, C.: Computational enhancements in low-rank semidefinite programming. Optim. Methods Softw. 21(3), 493\u2013512 (2006)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9141_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S. Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.C.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. Ser.\u00a0B 95(2), 329\u2013357 (2003)","journal-title":"Math. Program. Ser.\u00a0B"},{"issue":"3","key":"9141_CR7","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S. Burer","year":"2005","unstructured":"Burer, S., Monteiro, R.D.C.: Local minima and convergence in low-rank semidefinite programming. Math. Program. Ser.\u00a0A 103(3), 427\u2013444 (2005)","journal-title":"Math. Program. Ser.\u00a0A"},{"key":"9141_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10957-004-5150-4","volume":"123","author":"S.K. Chua","year":"2004","unstructured":"Chua, S.K., Toh, K.C., Zhao, G.Y.: An analytic center cutting plane method with deep cuts for semidefinite feasibility problems. J. Optim. Theory Appl. 123, 291\u2013318 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"9141_CR9","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/S1052623498340266","volume":"11","author":"J.-L. Goffin","year":"2000","unstructured":"Goffin, J.-L., Vial, J.-P.: Multiple cuts in the analytic center cutting plane methods. SIAM J. Optim. 11, 266\u2013288 (2000)","journal-title":"SIAM J. Optim."},{"key":"9141_CR10","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/S1052623493258635","volume":"6","author":"J.-L. Goffin","year":"1996","unstructured":"Goffin, J.-L., Luo, Z.-Q., Ye, Y.: Complexity analysis of an interior cutting plane for convex feasibility problems. SIAM J. Optim. 6, 638\u2013652 (1996)","journal-title":"SIAM J. Optim."},{"key":"9141_CR11","unstructured":"Helmberg, C.: Semidefinite programming for combinatorial optimization. Habilitationsschrift, ZIB-Report 00-34 (October 2000)"},{"key":"9141_CR12","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-002-0354-6","volume":"95","author":"C. Helmberg","year":"2003","unstructured":"Helmberg, C.: Numerical evaluation of SB method. Math. Program. 95, 381\u2013406 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"9141_CR13","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."},{"issue":"5","key":"9141_CR14","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1080\/1055678031000148696","volume":"18","author":"S. Kim","year":"2003","unstructured":"Kim, S., Kojima, M., Yamashita, M.: Second order cone programming relaxation of a positive semidefinite constraint. Optim. Methods Softw. 18(5), 535\u2013541 (2003)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9141_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1080\/10556780500065283","volume":"21","author":"K. Krishnan","year":"2006","unstructured":"Krishnan, K., Mitchell, J.E.: A unifying framework for several cutting plane methods for semidefinite programming. Optim. Methods Softw. 21(1), 57\u201374 (2006)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9141_CR16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10589-005-5958-3","volume":"33","author":"K. Krishnan","year":"2006","unstructured":"Krishnan, K., Mitchell, J.E.: A semidefinite programming based polyhedral cut-and-price approach for the maxcut problem. Comput. Optim. Appl. 33(1), 51\u201371 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"9141_CR17","doi-asserted-by":"crossref","unstructured":"Lewis, A.S., Overton, M.L.: Eigenvalue optimization, Acta Numer., 149\u2013190 (1996)","DOI":"10.1017\/S0962492900002646"},{"issue":"1","key":"9141_CR18","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/S1052623495294943","volume":"9","author":"Z.-Q. Luo","year":"1998","unstructured":"Luo, Z.-Q., Sun, J.: An analytic center based on column generation algorithm for convex quadratic feasibility problems. SIAM J. Optim. 9(1), 217\u2013235 (1998)","journal-title":"SIAM J. Optim."},{"key":"9141_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1023\/A:1008787027641","volume":"15","author":"Z.-Q. Luo","year":"2000","unstructured":"Luo, Z.-Q., Sun, J.: A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities. Comput. Optim. Appl. 15, 167\u2013191 (2000)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"9141_CR20","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1137\/S1052623498338321","volume":"10","author":"H.J. L\u00fcthi","year":"2000","unstructured":"L\u00fcthi, H.J., B\u00fceler, B.: The analytic center quadratic cut method (ACQCM) for strongly monotone variational inequality problems. SIAM J. Optim. 10(2), 415\u2013426 (2000)","journal-title":"SIAM J. Optim."},{"key":"9141_CR21","unstructured":"Mitchell, J.E., Basescu, V.L.: Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms. Technical report, Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180 (December 2006). Accepted for publication in Mathematical Methods of Operations Research"},{"key":"9141_CR22","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01580902","volume":"56","author":"J.E. Mitchell","year":"1992","unstructured":"Mitchell, J.E., Todd, M.J.: Solving combinatorial optimization problems using Karmarkar\u2019s algorithm. Math. Program. 56, 245\u2013284 (1992)","journal-title":"Math. Program."},{"issue":"4","key":"9141_CR23","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1137\/S1052623400374148","volume":"13","author":"M.R. Oskoorouchi","year":"2003","unstructured":"Oskoorouchi, M.R., Goffin, J.L.: The analytic center cutting plane method with semidefinite cuts. SIAM J. Optim. 13(4), 1029\u20131053 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9141_CR24","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/moor.1040.0116","volume":"30","author":"M.R. Oskoorouchi","year":"2005","unstructured":"Oskoorouchi, M.R., Goffin, J.L.: An interior point cutting plane method for the convex feasibility problem with second-order cone inequalities. Math. Oper. Res. 30(1), 127\u2013149 (2005)","journal-title":"Math. Oper. Res."},{"key":"9141_CR25","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10107-006-0727-3","volume":"109","author":"M.R. Oskoorouchi","year":"2007","unstructured":"Oskoorouchi, M.R., Goffin, J.L.: A matrix generation approach for eigenvalue optimization. Math. Program. Ser.\u00a0A 109, 155\u2013179 (2007)","journal-title":"Math. Program. Ser.\u00a0A"},{"key":"9141_CR26","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0802007","volume":"2","author":"M.L. Overton","year":"1992","unstructured":"Overton, M.L.: Large-scale optimization of eigenvalues. SIAM J. Optim. 2, 88\u2013120 (1992)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9141_CR27","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10107-002-0330-1","volume":"93","author":"F. Sharifi Mokhtarian","year":"2002","unstructured":"Sharifi Mokhtarian, F., Goffin, J.-L.: An analytic center quadratic cut method for the convex quadratic feasibility problem. Math. Program. Ser.\u00a0A 93(2), 305\u2013325 (2002)","journal-title":"Math. Program. Ser.\u00a0A"},{"key":"9141_CR28","unstructured":"Sivaramakrishnan, K.: A parallel conic interior point decomposition approach for BLOCK-ANGULAR semidefinite programs. Technical Report, Department of Mathematics, North Carolina State University, Raleigh, NC, 27695 (December 2006)"},{"key":"9141_CR29","unstructured":"Sivaramakrishnan, K., Plaza, G., Terlaky, T.: A conic interior point decomposition approach for large scale semidefinite programming. Technical Report, Department of Mathematics, North Carolina State University, Raleigh, NC, 27695 (December 2005)"},{"key":"9141_CR30","first-page":"311","volume":"84","author":"G. Sonnevend","year":"1988","unstructured":"Sonnevend, G.: New algorithms in convex programming based on a notation of center and on rational extrapolations. Int. Ser. Numer. Math. 84, 311\u2013327 (1988)","journal-title":"Int. Ser. Numer. Math."},{"key":"9141_CR31","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"J.F. Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"6","key":"9141_CR32","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1080\/1055678021000045123","volume":"17","author":"J.F. Sturm","year":"2002","unstructured":"Sturm, J.F.: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. Optim. Methods Softw. 17(6), 1105\u20131154 (2002)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9141_CR33","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1287\/moor.27.2.332.327","volume":"27","author":"J. Sun","year":"2002","unstructured":"Sun, J., Toh, K.C., Zhao, G.Y.: An analytic center cutting plane method for semidefinite feasibility problems. Math. Oper. Res. 27(2), 332\u2013346 (2002)","journal-title":"Math. Oper. Res."},{"key":"9141_CR34","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"K.C. Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3\u2014a Matlab software package for semidefinite programming, version 2.1. Optim. Methods Softw. 11, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"9141_CR35","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1137\/S1052623400370503","volume":"12","author":"K.C. Toh","year":"2002","unstructured":"Toh, K.C., Zhao, G.Y., Sun, J.: A multiple-cut analytic center cutting plane method for semidefinite feasibility problems. SIAM J. Optim. 12(4), 1126\u20131146 (2002)","journal-title":"SIAM J. Optim."},{"key":"9141_CR36","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"R.H. Tutuncu","year":"2003","unstructured":"Tutuncu, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. Ser.\u00a0B 95, 189\u2013217 (2003)","journal-title":"Math. Program. Ser.\u00a0B"},{"key":"9141_CR37","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0802002","volume":"2","author":"Y. Ye","year":"1992","unstructured":"Ye, Y.: A potential reduction algorithm allowing column generation. SIAM J. Optim. 2, 7\u201320 (1992)","journal-title":"SIAM J. Optim."},{"key":"9141_CR38","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0025-5610(96)00075-5","volume":"78","author":"Y. Ye","year":"1997","unstructured":"Ye, Y.: Complexity analysis of the analytic center cutting plane method that uses multiple cuts. Math. Program. 78, 85\u2013104 (1997)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9141-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9141-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9141-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:34Z","timestamp":1559302594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9141-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,20]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["9141"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9141-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,20]]}}}