{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:10:03Z","timestamp":1752379803694,"version":"3.41.2"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1021850032714","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T18:56:02Z","timestamp":1048272962000},"page":"63-81","source":"Crossref","is-referenced-by-count":2,"title":["Postponing the Choice of Penalty Parameter and Step Length"],"prefix":"10.1007","volume":"24","author":[{"given":"Fernando R.","family":"Villas-B\u00f4as","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clovis","family":"Perin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5110705_CR1","first-page":"499","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming. I: Affine and projective scaling trajectories. II: Legendre transform coordinates and central trajectories,\u201d Transactions of the American Mathematical Society, vol. 314, pp. 499\u2013581, 1989.","journal-title":"Transactions of the American Mathematical Society"},{"key":"5110705_CR2","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1137\/0803036","volume":"3","author":"T.J. Carpenter","year":"1993","unstructured":"T.J. Carpenter, I.J. Lustig, and D.F Shanno, \u201cHigher-order predictor-corrector interior point methods with application to quadratic objectives,\u201d SIAM Journal of Optimization, vol. 3, pp. 696\u2013725, 1993.","journal-title":"SIAM Journal of Optimization"},{"key":"5110705_CR3","doi-asserted-by":"crossref","unstructured":"J. Czyzyk, S. Mehrotra, M. Wagner, and S.J. Wright, PCx User Guide (Version 1.1). Optimization Technology Center, 1997.","DOI":"10.2172\/475586"},{"key":"5110705_CR4","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, JohnWiley & Sons: New York, 1968 (Reprint: SIAM Classics in Applied Mathematics, vol. 4, SIAM Publications: Philadelphia, 1990)."},{"key":"5110705_CR5","volume-title":"The logarithmic potential method for convex programming","author":"K.R. Frisch","year":"1955","unstructured":"K.R. Frisch, \u201cThe logarithmic potential method for convex programming,\u201d Unpublished manuscript, Institute of Economics, University of Oslo, Oslo, Norway, May 1955."},{"key":"5110705_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin, and M.H. Wright, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmakar's projective method,\u201d Mathematical Programming, vol. 36, pp. 183\u2013209, 1986.","journal-title":"Mathematical Programming"},{"key":"5110705_CR7","first-page":"19","volume-title":"Linear Inequalities and Related Systems","author":"A.J. Goldman","year":"1956","unstructured":"A.J. Goldman and A.W. Tucker, \u201cPolyedral convex cones,\u201d in Linear Inequalities and Related Systems, H.W. Kuhn and A.W. Tucker (Eds.), Princeton University Press: Princeton, NJ, 1956, pp. 19\u201340."},{"key":"5110705_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J. Gondzio","year":"1996","unstructured":"J. Gondzio, \u201cMultiple centrality corrections in a primal-dual method for linear programming,\u201d Computational Optimization and Applications, vol. 6, pp. 137\u2013156, 1996.","journal-title":"Computational Optimization and Applications"},{"key":"5110705_CR9","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1137\/S1052623494266869","volume":"6","author":"P. Hung","year":"1996","unstructured":"P. Hung and Y. Ye, \u201cAn asymptotical \n$$\\mathcal{O}(\\sqrt n L)$$\n-iteration path-following linear programming algorithm that uses wide neighbourhoods,\u201d SIAM Journal of Optimization, vol. 6, pp. 570\u2013586, 1996.","journal-title":"SIAM Journal of Optimization"},{"key":"5110705_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02191759","volume":"83","author":"B. Jansen","year":"1994","unstructured":"B. Jansen, C. Roos, T. Terlaky, and J.-Ph. Vial, \u201cPrimal-dual algorithms for linear programming based on the logarithmic barrier methods,\u201d Journal of Optimization Theory and Applications, vol. 83, pp. 1\u201326, 1994.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"5110705_CR11","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 polynonial-time algorithm for a class of linear complementarity problems,\u201d Mathematical Programming, vol. 44, pp. 1\u201326, 1989.","journal-title":"Mathematical Programming"},{"key":"5110705_CR12","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 Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo (Ed.), Springer Verlag: New York, 1989, pp. 29\u201347."},{"key":"5110705_CR13","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 Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddo (Ed.), Springer Verlag: New York, 1989, pp. 131\u2013158 (Identical version in: Proceedings of the 6th Mathematical Programming Symposium of Japan, Nagoya, Japan, 1986, pp. 1-35)."},{"issue":"4","key":"5110705_CR14","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,\u201d SIAM Journal on Optimization, vol. 2, no. 4, pp. 575\u2013601, 1992.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"5110705_CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R. Monteiro","year":"1990","unstructured":"R. Monteiro, I. Adler, and M. Resende, \u201cA polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and it's power series extension,\u201d Mathematics of Operations Research, vol. 15, no. 2, pp. 191\u2013213, 1990.","journal-title":"Mathematics of Operations Research"},{"key":"5110705_CR16","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,\u201d Mathematical Programming, vol. 44, pp. 27\u201341, 1989.","journal-title":"Mathematical Programming"},{"key":"5110705_CR17","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/0914063","volume":"14","author":"E. Ng","year":"1993","unstructured":"E. Ng and B.W. Peyton, \u201cBlock sparse Cholesky algorithms on advanced uniprocessor computers,\u201d SIAM Journal on Scientific Computing, vol. 14, pp. 1034\u20131056, 1993.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"5110705_CR18","unstructured":"J. Peng, C. Roos, and T. Terlaky, \u201cA new class of polynomial primal-dual methods for linear and semidefinite optimization,\u201d Technical report, Faculty of Information Technology and Systems, Delft University of Technology, December 1999."},{"issue":"1\u20134","key":"5110705_CR19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1019280614748","volume":"99","author":"J. Peng","year":"2000","unstructured":"J. Peng, C. Roos, and T. Terlaky, \u201cNew complexity analysis of the primal-dual Newton method for linear optimization,\u201d Annals of Operations Research, vol. 99, nos. 1\u20134, pp. 23\u201339, 2000.","journal-title":"Annals of Operations Research"},{"key":"5110705_CR20","series-title":"Lecture Notes in Control and Information Sciences","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1007\/BFb0043914","volume-title":"System Modelling and Optimization: Proceedings of the 12th IFIP-Conference held in Budapest, Hungary","author":"G. Sonnevend","year":"1986","unstructured":"G. Sonnevend, \u201cAn \u2018analytic center\u2019 for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,\u201d in System Modelling and Optimization: Proceedings of the 12th IFIP-Conference held in Budapest, Hungary, September 1985, A. Prekopa, J. Szelezsan, and B. Strazicky (Eds.), Lecture Notes in Control and Information Sciences, vol. 84, Springer Verlag: Berlin, West-Germany, 1986, pp. 866\u2013876."},{"key":"5110705_CR21","first-page":"3","volume-title":"Linear Inequalities and Related Systems","author":"A.W. Tucker","year":"1956","unstructured":"A.W. Tucker, \u201cDual systems of homogeneous linear relations,\u201d in Linear Inequalities and Related Systems, H.W. Kuhn and A.W. Tucker (Eds.), Princeton University Press: Princeton, NJ, 1956, pp. 3\u201318."},{"key":"5110705_CR22","unstructured":"X. Xu, \u201cAn \n$$\\mathcal{O}(\\sqrt n L)$$\n-iteration large-step infeasible path-following algorithm for linear programming,\u201d Technical report, Department of Management Sciences, The University of Iowa, Iowa City, Iowa 52242, USA, 1994."},{"key":"5110705_CR23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02206815","volume":"62","author":"X. Xu","year":"1996","unstructured":"X. Xu, P. Hung, and Y. Ye, \u201cA simplification of the homogeneous and self-dual linear programming algorithm and its implementation,\u201d Annals of Operations Research, vol. 62, pp. 151\u2013172, 1996.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"5110705_CR24","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0167-6377(95)00002-2","volume":"17","author":"X. Xu","year":"1995","unstructured":"X. Xu and Y. Ye, \u201cA generalized homogeneous and self-dual algorithm for linear programming,\u201d Operations Research Letters, vol. 17, no. 4, pp. 181\u2013190, 1995.","journal-title":"Operations Research Letters"},{"key":"5110705_CR25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y. Ye","year":"1994","unstructured":"Y. Ye, M.J. Todd, and S. Mizuno, \u201cAn \n$$\\mathcal{O}(\\sqrt n L)$$\n-iteration homogeneous and self-dual linear programming algorithm,\u201d Mathematics of Operations Research, vol. 19, pp. 53\u201367, 1994.","journal-title":"Mathematics of Operations Research"},{"key":"5110705_CR26","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y. Ye","year":"1997","unstructured":"Yinyu Ye, Interior Point Algorithms: Theory and Analysis, John Wiley and Sons, New York, 1997."},{"key":"5110705_CR27","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01585769","volume":"68","author":"Y. Zhang","year":"1995","unstructured":"Y. Zhang and D. Zhang, \u201cOn polynomiality of the mehotra-type predictor-corrector interior-point algorithms,\u201d Mathematical Programming, vol. 68, pp. 303\u2013318, 1995.","journal-title":"Mathematical Programming"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021850032714.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021850032714\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021850032714.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:28:23Z","timestamp":1752377303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021850032714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5110705"],"URL":"https:\/\/doi.org\/10.1023\/a:1021850032714","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}