{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T08:50:09Z","timestamp":1660294209112},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1007\/bf02614379","type":"journal-article","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T00:38:07Z","timestamp":1177720687000},"page":"95-115","source":"Crossref","is-referenced-by-count":2,"title":["Fast convergence of the simplified largest step path following algorithm"],"prefix":"10.1007","volume":"76","author":[{"given":"Clovis C.","family":"Gonzaga","sequence":"first","affiliation":[]},{"given":"J. Fr\u00e9d\u00e9ric","family":"Bonnans","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02614379_CR1","series-title":"Technical Report","volume-title":"The affine scaling method with centering","author":"E.R. Barnes","year":"1988","unstructured":"E.R. Barnes, S. Chopra and D.J. Jensen, \u201cThe affine scaling method with centering.\u201d Technical Report, Dept. of Mathematical Sciences, IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, 1988."},{"key":"BF02614379_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.21.1.1","volume":"21","author":"J.F. Bonnans","year":"1996","unstructured":"J.F. Bonnans and C.C. Gonzaga, \u201cConvergence of interior point algorithms for the monotone linear complementarity problem,\u201dMathematics of Operations Research 21 (1996) 1\u201325.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614379_CR3","doi-asserted-by":"crossref","unstructured":"C.C. Gonzaga, \u201cThe largest step path following algorithm for monotone linear complementarity problems,\u201dMathematical Programming, to appear.","DOI":"10.1007\/BF02614443"},{"key":"BF02614379_CR4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0801018","volume":"1","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, \u201cLarge steps path-following methods for linear programming. Part I: Barrier function method,\u201dSIAM Journal on Optimization 1 (1991) 268\u2013279.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02614379_CR5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga, \u201cPath following methods for linear programming,\u201dSIAM Review 34 (1992) 167\u2013227.","journal-title":"SIAM Review"},{"key":"BF02614379_CR6","unstructured":"C.C. Gonzaga and R.A. Tapia, \u201cOn the convergence of the Mizuno-Todd-Ye algorithm to the analytic center of the solution set,\u201dSIAM Journal on Optimization, to appear."},{"key":"BF02614379_CR7","unstructured":"C.C. Gonzaga and R.A. Tapia, \u201cOn the quadratic convergence of the simplified Mizuno-Todd-Ye algorithm for linear programming,\u201dSIAM Journal on Optimization, to appear."},{"key":"BF02614379_CR8","unstructured":"O. G\u00fcler, \u201cGeneralized linear complementarity problems and interior point algorithms for their solutions.\u201d Internal Report. Dept. of Industrial Engineering and Operations Research, University of California, 1993."},{"key":"BF02614379_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A unified approach to interior point algorithms for linear complementarity problems","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, T. Noma and A. Yoshise,A unified approach to interior point algorithms for linear complementarity problems, Lecture Notes in Computer Science, Vol. 538 (Springer, Berlin, 1991)."},{"key":"BF02614379_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA polynomial-time algorithm for a class of linear complementarity problems,\u201dMathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"BF02614379_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA primal-dual interior point algorithm for linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior Point and Related Methods (Springer, New York, 1989) pp. 29\u201347."},{"key":"BF02614379_CR12","series-title":"Technical Report","volume-title":"A genuine quadratically convergent polynomial interior point algorithm for linear programming","author":"Z.Q. Luo","year":"1993","unstructured":"Z.Q. Luo and Y. Ye, \u201cA genuine quadratically convergent polynomial interior point algorithm for linear programming.\u201d Technical Report. Dept. of Management Science, University of Iowa, Iowa City, IA 52242, 1993."},{"key":"BF02614379_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/0804014","volume":"4","author":"K. McShane","year":"1994","unstructured":"K. McShane, \u201cSuperlinearly convergent $$O(\\sqrt n L)$$ -iteration interior-point algorithms for LP and the monotone LCP,\u201dSIAM Journal on Optimization 4 (1994) 247\u2013261.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02614379_CR14","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior Point and Related Methods (Springer, New York, 1989) pp. 131\u2013158."},{"key":"BF02614379_CR15","series-title":"Technical Report","volume-title":"Quadratic convergence in a primal-dual method","author":"S. Mehrotra","year":"1991","unstructured":"S. Mehrotra, \u201cQuadratic convergence in a primal-dual method,\u201d Technical Report 91-15, Dept. of Industrial Engineering and Management Science, Northwestern University, Evanston, IL 60208, 1991."},{"key":"BF02614379_CR16","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"S. Mehrotra, \u201cOn the implementation of a primal-dual interior point method,\u201dSIAM Journal on Optimization 2 (1992) 575\u2013601.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02614379_CR17","unstructured":"S. Mchrotra, \u201cAsymptotic convergence in a generalized predictor-corrector method,\u201dMathematical Programming, to appear."},{"key":"BF02614379_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01580891","volume":"56","author":"S. Mizuno","year":"1992","unstructured":"S. Mizuno, \u201cA new polynomial time method for a linear complementarity problem,\u201dMathematical Programming 56 (1992) 31\u201343.","journal-title":"Mathematical Programming"},{"key":"BF02614379_CR19","doi-asserted-by":"crossref","unstructured":"S. Mizuno, M.J. Todd and Y. Ye, \u201cOn adaptive step primal-dual interior-point algorithms for linear programming,\u201dMathematics of Operations Research, to appear.","DOI":"10.1287\/moor.18.4.964"},{"key":"BF02614379_CR20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path following primal-dual algorithms: Part I: Linear programming,\u201dMathematical Programming 44 (1989) 27\u201341.","journal-title":"Mathematical Programming"},{"key":"BF02614379_CR21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path following primal-dual algorithms: Part II: Convex quadratic programming,\u201dMathematical Programming 44 (1989) 43\u201366.","journal-title":"Mathematical Programming"},{"key":"BF02614379_CR22","series-title":"Working Paper","volume-title":"Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem","author":"R.D.C. Monteiro","year":"1992","unstructured":"R.D.C. Monteiro and T. Tsuchiya, \u201cLimiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem.\u201d Working Paper 92-28, Dept. of Systems and Industrial Engineering, University of Arizona, Tucson, AZ 85721, Dec. 1992."},{"key":"BF02614379_CR23","volume-title":"Local convergence of interior-point algorithms for degenerate monotone LCP","author":"R.D.C. Monteiro","year":"1993","unstructured":"R.D.C. Monteiro and S. Wright, \u201cLocal convergence of interior-point algorithms for degenerate monotone LCP,\u201d Preprint MSC-P357-0493, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, April 1993."},{"key":"BF02614379_CR24","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01586056","volume":"54","author":"C. Roos","year":"1992","unstructured":"C. Roos and J.P. Vial, \u201cA polynomial method of approximate centers for linear programming,\u201dMathematical Programming 54 (1992) 295\u2013305.","journal-title":"Mathematical Programming"},{"key":"BF02614379_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01585691","volume":"53","author":"J. Renegar","year":"1992","unstructured":"J. Renegar and M. Shub, \u201cUnified complexity analysis for Newton LP methods,\u201dMathematical Programming 53 (1992) 1\u201316.","journal-title":"Mathematical Programming"},{"key":"BF02614379_CR26","doi-asserted-by":"crossref","DOI":"10.2172\/432433","volume-title":"A superquadratic infeasible-interior-point algorithm for linear complementarity problems","author":"S. Wright","year":"1994","unstructured":"S. Wright and Y. Zhang, \u201cA superquadratic infeasible-interior-point algorithm for linear complementarity problems.\u201d Preprint MSC-P418-0294, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, 1994."},{"key":"BF02614379_CR27","series-title":"Working Paper","volume-title":"Improving the asymptotic convergence of interior-point algorithms for linear programming","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, \u201cImproving the asymptotic convergence of interior-point algorithms for linear programming.\u201d Working Paper 91-15, Dept. of Management Science, University of Iowa, Iowa City, IA 52242, 1991."},{"key":"BF02614379_CR28","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF01585182","volume":"62","author":"Y. Ye","year":"1993","unstructured":"Y. Ye and K.M. Anstreicher, \u201cOn quadratic and $$O(\\sqrt n L)$$ convergence of a predictor-corrector algorithm for the linear complementary problem,\u201dMathematical Programming 62 (1993) 537\u2013551.","journal-title":"Mathematical Programming"},{"key":"BF02614379_CR29","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01581242","volume":"59","author":"Y. Ye","year":"1993","unstructured":"Y. Ye, O. G\u00fcler, R.A. Tapia and Y. Zhang, \u201cA quadratically convergent $$O(\\sqrt n L)$$ -iteration algorithm for linear programming,\u201dMathematical Programming 59 (1993) 151\u2013162.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614379.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02614379\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:49:25Z","timestamp":1558327765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02614379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["BF02614379"],"URL":"https:\/\/doi.org\/10.1007\/bf02614379","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}