{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:09:15Z","timestamp":1648656555335},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,24]],"date-time":"2015-02-24T00:00:00Z","timestamp":1424736000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10957-015-0714-z","type":"journal-article","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T16:01:43Z","timestamp":1424707303000},"page":"558-571","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems"],"prefix":"10.1007","volume":"166","author":[{"given":"Sungwoo","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dianne P.","family":"O\u2019Leary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"issue":"4","key":"714_CR1","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/S1052623495294955","volume":"8","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. SIAM J. Optim. 8(4), 1007\u20131028 (1998)","journal-title":"SIAM J. Optim."},{"key":"714_CR2","volume-title":"A Build-Up Interior-Point Method for Linear Programming: Affine Scaling Form. Tech. Rep.","author":"GB Dantzig","year":"1991","unstructured":"Dantzig, G.B., Ye, Y.: A Build-Up Interior-Point Method for Linear Programming: Affine Scaling Form. Tech. Rep. Stanford University, Stanford (1991)"},{"issue":"3","key":"714_CR3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01581252","volume":"59","author":"K Tone","year":"1993","unstructured":"Tone, K.: An active-set strategy in an interior point method for linear programming. Math. Progr. 59(3), 345\u2013360 (1993)","journal-title":"Math. Progr."},{"key":"714_CR4","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1287\/mnsc.39.6.757","volume":"39","author":"JA Kaliski","year":"1993","unstructured":"Kaliski, J.A., Ye, Y.: A decomposition variant of the potential reduction algorithm for linear programming. Manag. Sci. 39, 757\u2013776 (1993)","journal-title":"Manag. Sci."},{"key":"714_CR5","doi-asserted-by":"crossref","unstructured":"Hertog, D.D., Roos, C., Terlaky, T.: Adding and deleting constraints in the path-following method for LP. In: Advances in Optimization and Approximation, vol. 1, pp. 166\u2013185. Springer, New York (1994)","DOI":"10.1007\/978-1-4613-3629-7_8"},{"issue":"1","key":"714_CR6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/050633421","volume":"17","author":"AL Tits","year":"2006","unstructured":"Tits, A.L., Absil, P.A., Woessner, W.P.: Constraint reduction for linear programs with many inequality constraints. SIAM J. Optim. 17(1), 119\u2013146 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"714_CR7","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1007\/s10589-010-9389-4","volume":"51","author":"LB Winternitz","year":"2012","unstructured":"Winternitz, L.B., Nicholls, S.O., Tits, A.L., O\u2019Leary, D.P.: A constraint-reduced variant of Mehrotra\u2019s predictor-corrector algorithm. Comput. Optim. Appl. 51(3), 1001\u20131036 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"714_CR8","first-page":"156","volume":"31","author":"JH Jung","year":"2008","unstructured":"Jung, J.H., O\u2019Leary, D.P., Tits, A.L.: Adaptive constraint reduction for training support vector machines. Electron. Trans. Numer. Anal. 31, 156\u2013177 (2008)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"714_CR9","volume-title":"The Use of Preconditioning for Training Support Vector Machines, Master\u2019s Thesis, Applied Mathematics and Scientific Computing Program","author":"JA Williams","year":"2008","unstructured":"Williams, J.A.: The Use of Preconditioning for Training Support Vector Machines, Master\u2019s Thesis, Applied Mathematics and Scientific Computing Program. University of Maryland, College Park (2008)"},{"issue":"1","key":"714_CR10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10589-010-9324-8","volume":"51","author":"JH Jung","year":"2012","unstructured":"Jung, J.H., O\u2019Leary, D.P., Tits, A.L.: Adaptive constraint reduction for convex quadratic programming. Comput. Optim. Appl. 51(1), 125\u2013157 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"714_CR11","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(2), 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"714_CR12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M Kojima","year":"1997","unstructured":"Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7(1), 86\u2013125 (1997)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"714_CR13","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"RDC Monteiro","year":"1997","unstructured":"Monteiro, R.D.C.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7(3), 663\u2013678 (1997)","journal-title":"SIAM J. Optim."},{"key":"714_CR14","unstructured":"Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming. Tech. rep., Manuscript presented at the Math. Programming Symposium, Ann Arbor, MI (1994)"},{"issue":"1","key":"714_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"YE Nesterov","year":"1997","unstructured":"Nesterov, Y.E., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22(1), 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"714_CR16","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/S1052623495290209","volume":"8","author":"YE Nesterov","year":"1998","unstructured":"Nesterov, Y.E., Todd, M.J.: Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"714_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01580085","volume":"81","author":"RDC Monteiro","year":"1998","unstructured":"Monteiro, R.D.C., Zhang, Y.: A unified analysis for a class of long-step primal-dual path-following interior point algorithms for semidefinite programming. Math. Progr. 81(3), 281\u2013299 (1998)","journal-title":"Math. Progr."},{"issue":"2","key":"714_CR18","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y Zhang","year":"1998","unstructured":"Zhang, Y.: On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8(2), 365\u2013386 (1998)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"714_CR19","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F Alizadeh","year":"1998","unstructured":"Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim. 8(3), 746\u2013768 (1998)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"714_CR20","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1137\/S1052623496308618","volume":"8","author":"RDC Monteiro","year":"1998","unstructured":"Monteiro, R.D.C.: Polynomial convergence of primal-dual algorithms for semidefinite programming based on Monteiro and Zhang family of directions. SIAM J. Optim. 8(3), 797\u2013812 (1998)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"714_CR21","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01581723","volume":"80","author":"M Kojima","year":"1998","unstructured":"Kojima, M., Shida, M., Shindoh, S.: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Math. Progr. 80(2), 129\u2013160 (1998)","journal-title":"Math. Progr."},{"issue":"1","key":"714_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1021700210959","volume":"99","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: Superlinear convergence of interior-point algorithms for semidefinite programming. J. Optim. Theory Appl. 99(1), 103\u2013119 (1998)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"714_CR23","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1137\/S1052623496300623","volume":"9","author":"M Kojima","year":"1999","unstructured":"Kojima, M., Shida, M., Shindoh, S.: A predictor-corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh\u2013Haeberly\u2013Overton search direction. SIAM J. Optim. 9(2), 444\u2013465 (1999)","journal-title":"SIAM J. Optim."},{"key":"714_CR24","unstructured":"Potra, F.A., Sheng, R.: Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood. Tech. Rep. 91, Reports on Computational Mathematics, Department of Mathematics, University of Iowa (1996)"},{"issue":"1","key":"714_CR25","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/S1052623497316828","volume":"10","author":"J Ji","year":"1999","unstructured":"Ji, J., Potra, F.A., Sheng, R.: On the local convergence of a predictor-corrector method for semidefinite programming. SIAM J. Optim. 10(1), 195\u2013210 (1999)","journal-title":"SIAM J. Optim."},{"key":"714_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)"},{"issue":"4","key":"714_CR27","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A Schrijver","year":"1979","unstructured":"Schrijver, A.: A comparison of the Delsarte and Lovi\u00e1sz bounds. IEEE Trans. Inf. Theory 25(4), 425\u2013429 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"714_CR28","doi-asserted-by":"crossref","first-page":"1559","DOI":"10.1137\/070711141","volume":"19","author":"E Klerk de","year":"2008","unstructured":"de Klerk, E., Pasechnik, D.V., Sotirov, R.: On semidefinite programming relaxations of the traveling salesman problem. SIAM J. Optim. 19(4), 1559\u20131573 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"714_CR29","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1090\/S0894-0347-07-00589-9","volume":"21","author":"C Bachoc","year":"2007","unstructured":"Bachoc, C., Vallentin, F.: New upper bounds for kissing number from semidefinite programming. J. Am. Math. Soc. 21(3), 909\u2013924 (2007)","journal-title":"J. Am. Math. Soc."},{"issue":"1","key":"714_CR30","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q Zhao","year":"1998","unstructured":"Zhao, Q., Karisch, S.E., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. J. Comb. Optim. 2(1), 71\u2013109 (1998)","journal-title":"J. Comb. Optim."},{"key":"714_CR31","unstructured":"Park, S.: Matrix Reduction in Numerical Optimization, Ph.D. Thesis, Computer Science Department, University of Maryland, College Park (2011). http:\/\/drum.lib.umd.edu\/handle\/1903\/11751"},{"key":"714_CR32","first-page":"715","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization","author":"KC Toh","year":"2012","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: On the implementation and usage of SDPT3 - a MATLAB software package for semidefinite-quadratic-linear programming, version 4.0. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, vol. 166, pp. 715\u2013754. Springer, New York (2012)"},{"key":"714_CR33","unstructured":"Park, S., O\u2019Leary, D.P.: A Polynomial Time Constraint Reduced Algorithm for Semidefinite Optimization Problems, with Convergence Proofs. Tech. rep., University of Maryland, College Park (2015). http:\/\/www.optimization-online.org\/DB_HTML\/2013\/08\/4011.html"},{"key":"714_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications","author":"E Klerk de","year":"2002","unstructured":"de Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Kluwer Academic Publishers, Norwell (2002)"},{"key":"714_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5561-9","volume-title":"Interior Point Techniques in Optimization","author":"B Jansen","year":"1997","unstructured":"Jansen, B.: Interior Point Techniques in Optimization. Kluwer Academic Publishers, Norwell (1997)"},{"issue":"1","key":"714_CR36","first-page":"235","volume":"79","author":"K Fujisawa","year":"1997","unstructured":"Fujisawa, K., Kojima, M., Nakata, K.: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Math. Progr. 79(1), 235\u2013253 (1997)","journal-title":"Math. Progr."},{"issue":"2","key":"714_CR37","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1137\/0905023","volume":"5","author":"W Hager","year":"1984","unstructured":"Hager, W.: Condition estimates. SIAM J. Sci. Stat. Comput. 5(2), 311\u2013316 (1984)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"4","key":"714_CR38","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/1029112","volume":"9","author":"N Higham","year":"1987","unstructured":"Higham, N.: A survey of condition number estimation for triangular matrices. SIAM Rev. 9(4), 575\u2013596 (1987)","journal-title":"SIAM Rev."},{"issue":"2","key":"714_CR39","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1137\/0901014","volume":"1","author":"DP O\u2019Leary","year":"1980","unstructured":"O\u2019Leary, D.P.: Estimating matrix condition numbers. SIAM J. Sci. Stat. Comput. 1(2), 205\u2013209 (1980)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"3","key":"714_CR40","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0717034","volume":"17","author":"PGW Stewart","year":"1980","unstructured":"Stewart, P.G.W.: Efficient generation of random orthogonal matrices with an application to condition estimators. SIAM J. Numer. Anal. 17(3), 403\u2013409 (1980)","journal-title":"SIAM J. Numer. Anal."},{"issue":"126","key":"714_CR41","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1090\/S0025-5718-1974-0343558-6","volume":"28","author":"PE Gill","year":"1974","unstructured":"Gill, P.E., Golub, G.H., Murray, W., Saunders, M.A.: Methods for modifying matrix factorizations. Math. Comput. 28(126), 505\u2013535 (1974)","journal-title":"Math. Comput."},{"key":"714_CR42","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971811","volume-title":"LINPACK Users\u2019 Guide","author":"JJ Dongarra","year":"1979","unstructured":"Dongarra, J.J., Moler, C.B., Bunch, J.R., Stewart, G.W.: LINPACK Users\u2019 Guide. SIAM, Philadelphia, PA (1979)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0714-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-015-0714-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0714-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:58:42Z","timestamp":1559469522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-015-0714-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,24]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["714"],"URL":"https:\/\/doi.org\/10.1007\/s10957-015-0714-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,24]]}}}