{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T22:06:12Z","timestamp":1705961172856},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s11424-012-0317-9","type":"journal-article","created":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T07:47:58Z","timestamp":1356680878000},"page":"1108-1121","source":"Crossref","is-referenced-by-count":5,"title":["A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization"],"prefix":"10.1007","volume":"25","author":[{"given":"Mingwang","family":"Zhang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,29]]},"reference":[{"key":"317_CR1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. K. Karmarkar","year":"1984","unstructured":"N. K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, 1984, 4: 373\u2013395.","journal-title":"Combinatorica"},{"key":"317_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms, Theory and Analysis","author":"Y. Ye","year":"1997","unstructured":"Y. Ye, Interior Point Algorithms, Theory and Analysis, Wiley, UK, 1997."},{"key":"317_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970777","volume-title":"Linear Matrix Inequalities in System and Control Theory","author":"S. Boyd","year":"1994","unstructured":"S. Boyd, L. EI Ghaoui, E. Fern, et al., Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia, PA, 1994."},{"key":"317_CR4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM Journal on Optimization, 1995, 5: 13\u201351.","journal-title":"SIAM Journal on Optimization"},{"key":"317_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Methods in Convex Programming: Theory and Applications","author":"Y. E. Nesterov","year":"1994","unstructured":"Y. E. Nesterov and A. S. Nemirovsky, Interior Point Methods in Convex Programming: Theory and Applications, SIAM, Philadelphia, PA, 1994."},{"key":"317_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of Semidefinite Programming: Theory, Algorithms, and Applications","author":"H. Wolkowicz","year":"2000","unstructured":"H. Wolkowicz, R. Saigal, and L. Vandenberghe, Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, Kluwer Academic publishers, Dordrecht, The Netherlands, 2000."},{"key":"317_CR7","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":"E. de Klerk, Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications, Kluwer Academic Publishers, Dordrecht. The Netherlands, 2002."},{"key":"317_CR8","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/10556789908805757","volume":"11\/12","author":"J. Czyayk","year":"1999","unstructured":"J. Czyayk, S. Mehrotra, M. Wagner, et al., PCx: An interior-point code for linear programming, Optimization Methods and Software, 1999, 11\/12: 397\u2013430.","journal-title":"Optimization Methods and Software"},{"key":"317_CR9","first-page":"1","volume":"10","author":"Y. Thang","year":"1999","unstructured":"Y. Thang, Solving large-scale linear programmes by interior point methods under the Matlab environment, Optimization Methods and Software, 1999, 10: 1\u201331.","journal-title":"Optimization Methods and Software"},{"key":"317_CR10","unstructured":"CPLEX: ILOG Optimization, http:\/\/www.ilog.com ."},{"key":"317_CR11","unstructured":"M. Salahi, J. Peng, and T. Terlaky, On Mehrotra-type predictor-corrector algorithms, Technical Report 2005\/4, Advanced Optimization Lab., Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada."},{"key":"317_CR12","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.amc.2006.05.092","volume":"183","author":"M. Salahi","year":"2006","unstructured":"M. Salahi and N. M. Amiri, Polynomial time second order Mehrotra-type predictor-corrector algorithms, Applied Mathematics and Computation, 2006, 183: 646\u2013658.","journal-title":"Applied Mathematics and Computation"},{"key":"317_CR13","unstructured":"M. H. Koulaei and T. Terlaky, On the extension of a Mehrotra-type algorithm for semidefinite optimization, Technical Report 2007\/4, Advanced optimization Lab., Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada."},{"key":"317_CR14","first-page":"281","volume":"81","author":"R. D. C. Monteiro","year":"1998","unstructured":"R. D. C. Monteiro and Y. Zhang, A unified analysis for a class of long-step primal-dual pathfollowing interior-point algorithms for semidefinite programming, Mathematical Programming, 1998, 81: 281\u2013299.","journal-title":"Mathematical Programming"},{"key":"317_CR15","volume-title":"Matrix Analysis","author":"R. A. Horn","year":"1986","unstructured":"R. A. Horn and R. J. Charles, Matrix Analysis, Cambridge University Press, UK, 1986."},{"key":"317_CR16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/S1052623495296115","volume":"8","author":"Y. Zhang","year":"1998","unstructured":"Y. Zhang, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM Journal on Optimization, 1998, 8: 365\u2013383.","journal-title":"SIAM Journal on Optimization"},{"key":"317_CR17","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/S1052623496304700","volume":"8","author":"F. Alizadeh","year":"1998","unstructured":"F. Alizadeh, J. A. Haeberly, and M. Dverton, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM Journal on Optimization 1998, 8: 746\u2013768.","journal-title":"SIAM Journal on Optimization"},{"key":"317_CR18","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. Vanderdei, et al., An interior-point method for semidefinite programming, SIAM Journal on Optimization, 1996, 6: 342\u2013361.","journal-title":"SIAM Journal on Optimization"},{"key":"317_CR19","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M. Kojima","year":"1997","unstructured":"M. Kojima, M. Shindoh, and S. Hara, Interior point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM Journal on Optimization, 1997, 7: 86\u2013125.","journal-title":"SIAM Journal on Optimization"},{"key":"317_CR20","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/S1052623495293056","volume":"7","author":"R. D. C. Monteiro","year":"1997","unstructured":"R. D. C. Monteiro, Primal-dual path-following algorithms for semidefinite programming, SIAM Journal on Optimization, 1997, 7: 663\u2013678.","journal-title":"SIAM Journal on Optimization"},{"key":"317_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Y. E. Nesterov","year":"1997","unstructured":"Y. E. Nesterov and M. J. Todd, Self-scaled barriers and interior-point methods for convex programming, Mathematics of Operations Research, 1997, 22: 1\u201342.","journal-title":"Mathematics of Operations Research"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-012-0317-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-012-0317-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-012-0317-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:54:03Z","timestamp":1559400843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-012-0317-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["317"],"URL":"https:\/\/doi.org\/10.1007\/s11424-012-0317-9","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}