{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:08:03Z","timestamp":1649207283919},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T00:00:00Z","timestamp":1457654400000},"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":[[2016,8]]},"DOI":"10.1007\/s10957-016-0917-y","type":"journal-article","created":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T11:56:29Z","timestamp":1457697389000},"page":"512-527","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Constraint-Reduced Algorithm for Semidefinite Optimization Problems with Superlinear Convergence"],"prefix":"10.1007","volume":"170","author":[{"given":"Sungwoo","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,11]]},"reference":[{"issue":"3","key":"917_CR1","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. Opt. 8(3), 746\u2013768 (1998)","journal-title":"SIAM J. Opt."},{"issue":"2","key":"917_CR2","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. Opt. 6(2), 342\u2013361 (1996)","journal-title":"SIAM J. Opt."},{"issue":"1","key":"917_CR3","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. Opt. 7(1), 86\u2013125 (1997)","journal-title":"SIAM J. Opt."},{"issue":"3","key":"917_CR4","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. Opt. 7(3), 663\u2013678 (1997)","journal-title":"SIAM J. Opt."},{"issue":"2","key":"917_CR5","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. Opt. 8(2), 324\u2013364 (1998)","journal-title":"SIAM J. Opt."},{"issue":"4","key":"917_CR6","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. Opt. 8(4), 1007\u20131028 (1998)","journal-title":"SIAM J. Opt."},{"issue":"2","key":"917_CR7","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. Prog. 80(2), 129\u2013160 (1998)","journal-title":"Math. Prog."},{"issue":"1","key":"917_CR8","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. Opt. Theory Appl. 99(1), 103\u2013119 (1998)","journal-title":"J. Opt. Theory Appl."},{"key":"917_CR9","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\u2014a 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":"917_CR10","unstructured":"Fujisawa, K., Kojima, M., Nakata, K.: SDPA (semidefinite programming algorithm) Users Manual B-308. Technical Report, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Japan (1996)"},{"issue":"3","key":"917_CR11","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M Fukuda","year":"2000","unstructured":"Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion I: implementation and numerical results. SIAM J. Opt. 11(3), 647\u2013674 (2000)","journal-title":"SIAM J. Opt."},{"issue":"1","key":"917_CR12","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. Opt. 17(1), 119\u2013146 (2006)","journal-title":"SIAM J. Opt."},{"issue":"3","key":"917_CR13","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":"917_CR14","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":"917_CR15","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, MD (2008)"},{"issue":"1","key":"917_CR16","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."},{"key":"917_CR17","doi-asserted-by":"crossref","unstructured":"Park, S., O\u2019Leary, D.P.: A polynomial time constraint-reduced algorithm for semidefinite optimization problems. J. Opt. Theory Appl. (2015)","DOI":"10.1007\/s10957-015-0714-z"},{"key":"917_CR18","unstructured":"Park, S., O\u2019Leary, D.P.: A polynomial time constraint reduced algorithm for semidefinite optimization problems, with convergence proofs. Technical Report, University of Maryland, College Park, MD (2015). http:\/\/www.optimization-online.org\/DB_HTML\/2013\/08\/4011.html"},{"key":"917_CR19","unstructured":"Park, S.: A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence. Technical Report, KCG Holdings (2015). http:\/\/www.optimization-online.org\/DB_HTML\/2015\/05\/4919.html"},{"key":"917_CR20","unstructured":"Park, S.: Matrix reduction in numerical optimization. Ph.D. thesis, Computer Science Department, Univ. of Maryland, College Park, MD (2011). http:\/\/drum.lib.umd.edu\/handle\/1903\/11751"},{"issue":"1","key":"917_CR21","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. Prog. 79(1), 235\u2013253 (1997)","journal-title":"Math. Prog."},{"issue":"1","key":"917_CR22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02614432","volume":"77","author":"F Alizadeh","year":"1997","unstructured":"Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Complementarity and nondegeneracy in semidefinite programming. Math. Prog. 77(1), 111\u2013128 (1997)","journal-title":"Math. Prog."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-0917-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-016-0917-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-0917-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T09:12:36Z","timestamp":1567674756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-016-0917-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,11]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["917"],"URL":"https:\/\/doi.org\/10.1007\/s10957-016-0917-y","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,11]]}}}