{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:11:21Z","timestamp":1648699881742},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T00:00:00Z","timestamp":1441670400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11590-015-0940-1","type":"journal-article","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T16:59:10Z","timestamp":1441731550000},"page":"1417-1448","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Rupaj Kumar","family":"Nayak","sequence":"first","affiliation":[]},{"given":"Jitamitra","family":"Desai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,8]]},"reference":[{"key":"940_CR1","unstructured":"Kocvara: Sparse SDP\u2019s from structural optimization. http:\/\/plato.asu.edu\/ftp\/kocvara\/"},{"key":"940_CR2","unstructured":"SDP: More SDP problems. http:\/\/plato.asu.edu\/ftp\/sdp\/"},{"key":"940_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1018369223322","volume":"10","author":"ED Andersen","year":"1998","unstructured":"Andersen, E.D., Ye, Y.: A computational study of the homogeneous algorithm for large scale convex optimization. Comput. Optim. Appl. 10, 243\u2013269 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"940_CR4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s101070050027","volume":"84","author":"ED Andersen","year":"1999","unstructured":"Andersen, E.D., Ye, Y.: On a homogeneous algorithm for the monotone complementarity problem. Math. Progr. 84, 375\u2013399 (1999)","journal-title":"Math. Progr."},{"key":"940_CR5","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1080\/10556789908805769","volume":"11 & 12","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: SDPLIB 1.2, a library of semidefinite programming test problems. Optim. Methods Softw. 11 & 12, 683\u2013690 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1\u20134","key":"940_CR6","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1080\/10556789908805763","volume":"11","author":"N Brixius","year":"1999","unstructured":"Brixius, N., Potra, F.A., Sheng, R.: Sdpha: a matlab implementation of homogeneous interior-point algorithms for semidefinite programming. Optim. Methods Softw. 11(1\u20134), 583\u2013596 (1999)","journal-title":"Optim. Methods Softw."},{"key":"940_CR7","first-page":"1127","volume":"6","author":"F Chen","year":"2011","unstructured":"Chen, F., Zuo, Z.: Polynomial convergence of predictor-corrector for SDLCP based on the M-Z family of directions. Int. Math. Forum. 6, 1127\u20131134 (2011)","journal-title":"Int. Math. Forum."},{"key":"940_CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01586933","volume":"51","author":"RM Freund","year":"1991","unstructured":"Freund, R.M.: Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function. Math. Program. 51, 203\u2013222 (1991)","journal-title":"Math. Program."},{"key":"940_CR9","first-page":"285","volume":"40","author":"D Goldfarb","year":"1988","unstructured":"Goldfarb, D., Mehrotra, S.: A relaxed variant of Karmarkar\u2019s algorithm. Math. Program. 40, 285\u2013315 (1988)","journal-title":"Math. Program."},{"key":"940_CR10","unstructured":"Grant, M., Boyd, S.: CVX: matlab software for disciplined convex programming, version 2.0 beta. http:\/\/cvxr.com\/cvx (2013)"},{"key":"940_CR11","doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs, recent advances in learning and control (a tribute to M. Vidyasagar). In: Blondel, V., Boyd, S., Kimura, H., (eds.) Lecture notes in control and information sciences, pp. 95\u2013110 (2008)","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"940_CR12","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, 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"key":"940_CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: An $$O(\\sqrt{n}L)$$ O ( n L ) iteration potential reduction algorithm for linear complementary problems. Math. Program. 50, 331\u2013342 (1991)","journal-title":"Math. Program."},{"key":"940_CR14","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, 86\u2013125 (1997)","journal-title":"SIAM J. Optim."},{"key":"940_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s101070050046","volume":"85","author":"M Kojima","year":"1999","unstructured":"Kojima, M., Shida, M., Shindoh, S.: Search directions in the SDP and the monotone SDLCP: generalization and inexact computation. Math. Program. 85, 51\u201380 (1999)","journal-title":"Math. Program."},{"key":"940_CR16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"1","key":"940_CR17","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0805003","volume":"5","author":"S Mizuno","year":"1995","unstructured":"Mizuno, S., Kojima, M., Todd, M.: Infeasible interior point primal dual potential reduction algorithms for linear programming. SIAM J. Optim. 5(1), 52\u201367 (1995)","journal-title":"SIAM J. Optim."},{"key":"940_CR18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10107980021a","volume":"84","author":"RDC Monteiro","year":"1999","unstructured":"Monteiro, R.D.C., Tsuchiya, T.: Polynomiality of primal dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions. Math. Program. 84, 39\u201353 (1999)","journal-title":"Math. Program."},{"key":"940_CR19","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, 663\u2013678 (1997)","journal-title":"SIAM J. Optim."},{"key":"940_CR20","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1080\/10556788.2011.634911","volume":"27","author":"S Mehorotra","year":"2012","unstructured":"Mehorotra, S., Huang, K.L.: Computational experience with a modified potential reduction algorithm for linear programming. Optim. Methods Softw. 27, 865\u2013891 (2012)","journal-title":"Optim. Methods Softw."},{"key":"940_CR21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02903846","volume":"43","author":"J Nie","year":"2000","unstructured":"Nie, J., Yuan, Y.: A potential reduction algorithm for an extended SDP problem. Sci. China Ser. A Math. 43, 35\u201346 (2000)","journal-title":"Sci. China Ser. A Math."},{"issue":"1\u20133","key":"940_CR22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/10556789808805691","volume":"9","author":"FA Potra","year":"1998","unstructured":"Potra, F.A., Sheng, R.: On homogeneous interior point algorithms for semidefinite programming. Optim. Methods Softw. 9(1\u20133), 161\u2013184 (1998)","journal-title":"Optim. Methods Softw."},{"key":"940_CR23","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, 1007\u20131028 (1998)","journal-title":"SIAM J. Optim."},{"key":"940_CR24","unstructured":"Slater, M.: Lagrange multipliers revisited: a contribution to non-linear programming. Cowels commission discussion paper. Mathematics 403 (1950)"},{"key":"940_CR25","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1013777203597","volume":"21","author":"KC Toh","year":"2002","unstructured":"Toh, K.C.: A note on the calculations of step lengths in interior point methods for semidefinite programming. Comput. Optim. Appl. 21, 301\u2013310 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"940_CR26","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BFb0042787","volume":"113","author":"K Tanabe","year":"1988","unstructured":"Tanabe, K.: Centered Newton method for mathematical programming. Syst. Model. Optim. 113, 197\u2013206 (1988)","journal-title":"Syst. Model. Optim."},{"key":"940_CR27","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1287\/moor.15.3.508","volume":"15","author":"M Todd","year":"1990","unstructured":"Todd, M., Ye, Y.: A centered projective algorithm for linear programming. Math. Oper. Res. 15, 508\u2013529 (1990)","journal-title":"Math. Oper. Res."},{"key":"940_CR28","first-page":"3","volume":"76","author":"MJ Todd","year":"1996","unstructured":"Todd, M.J.: Potential-reduction methods in mathematical programming. Math. Program. 76, 3\u201345 (1996)","journal-title":"Math. Program."},{"key":"940_CR29","doi-asserted-by":"crossref","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 (2010)","DOI":"10.1007\/978-1-4614-0769-0_25"},{"key":"940_CR30","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite quadratic linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003)","journal-title":"Math. Program."},{"key":"940_CR31","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0168-9274(98)00098-1","volume":"29","author":"L Vandenberghe","year":"1999","unstructured":"Vandenberghe, L., Boyd, S.: Applications of semidefinite programming. Appl. Numer. Math. 29, 283\u2013299 (1999)","journal-title":"Appl. Numer. Math."},{"key":"940_CR32","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02206815","volume":"62","author":"X Xu","year":"1996","unstructured":"Xu, X., Hung, P., Ye, Y.: A simplified homogeneous and self dual linear programming algorithm and its implementation. Ann. Oper. Res. 62, 151\u2013171 (1996)","journal-title":"Ann. Oper. Res."},{"key":"940_CR33","unstructured":"Ye, Y.: A class of potential functions for linear programming. Technical report, department of management sciences, The University of Iowa (1988)"},{"key":"940_CR34","unstructured":"Ye, Y., Todd. M.J., Mizuno, S.: An $$O(\\sqrt{n}L)-$$ O ( n L ) - iteration homogenous and self dual linear programming algorithm. Technical report. 1007 (1992)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0940-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0940-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0940-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T08:17:02Z","timestamp":1567153022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0940-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,8]]},"references-count":34,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["940"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0940-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,8]]}}}