{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:41Z","timestamp":1747548341471},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1007\/bf02206817","type":"journal-article","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T00:32:15Z","timestamp":1128558735000},"page":"197-231","source":"Crossref","is-referenced-by-count":21,"title":["Primal-dual target-following algorithms for linear programming"],"prefix":"10.1007","volume":"62","author":[{"given":"B.","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Roos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. -Ph.","family":"Vial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02206817_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01758841","volume":"8","author":"I. Adler","year":"1992","unstructured":"I. Adler and R.D.C. Monteiro, A geometric view of parametric linear programming, Algorithmica 8(1992)161\u2013176.","journal-title":"Algorithmica"},{"key":"BF02206817_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01581079","volume":"57","author":"D.S. Atkinson","year":"1992","unstructured":"D.S. Atkinson and P.M. Vaidya, A scaling technique for finding the weighted analytic center of a polytope, Mathematical Programming 57(1992)163\u2013192.","journal-title":"Mathematical Programming"},{"key":"BF02206817_CR3","first-page":"499","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"D.A. Bayer and J.C. Lagarias, The nonlinear geometry of linear programming, Part II: Legendre transform coordinates. Transactions of the American Mathematical Society 314(1989)499\u2013526.","journal-title":"Transactions of the American Mathematical Society"},{"key":"BF02206817_CR4","first-page":"679","volume":"15","author":"J. Ding","year":"1990","unstructured":"J. Ding and T.Y. Li, An algorithm based on weighted logarithmic barrier functions for linear complementarity problems, Arabian Journal for Science and Engineering 15(1990)679\u2013685.","journal-title":"Arabian Journal for Science and Engineering"},{"key":"BF02206817_CR5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19(1972)248\u2013264.","journal-title":"Journal of the ACM"},{"key":"BF02206817_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01581277","volume":"58","author":"R.M. Freund","year":"1993","unstructured":"R.M. Freund, Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for thew-center problem, Mathematical Programming 58(1993)385\u2013414.","journal-title":"Mathematical Programming"},{"key":"BF02206817_CR7","volume-title":"Short steps with Karmarkar's projective algorithm for linear programming","author":"J.L. Goffin","year":"1990","unstructured":"J.L. Goffin and J.-Ph. Vial, Short steps with Karmarkar's projective algorithm for linear programming, Manuscript, D\u00e9partment d'Economie Commerciale et Industrielle, Universit\u00e9 de Gen\u00e8ve, Gen\u00e8ve, Switzerland (1990); a version with no weight appeared in SIAM Journal on Optimization 4(1994)193."},{"key":"BF02206817_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01580602","volume":"60","author":"J.L. Goffin","year":"1993","unstructured":"J.L. Goffin and J.-Ph. Vial, On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm, Mathematical Programming 60(1993)81\u201392.","journal-title":"Mathematical Programming"},{"key":"BF02206817_CR9","volume-title":"On the convergence of the Mizuno-Todd-Ye algorithm to the analytic center of the solution set","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga and R.A. Tapia, On the convergence of the Mizuno-Todd-Ye algorithm to the analytic center of the solution set, Technical Report 92-36, Dept. of Mathematical Sciences, Rice University, Houston, TX 77251, USA (1992)."},{"key":"BF02206817_CR10","volume-title":"On the quadratic convergence of the simplified Mizuno-Todd-Ye algorithm for linear programming","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga and R.A. Tapia, On the quadratic convergence of the simplified Mizuno-Todd-Ye algorithm for linear programming, Technical Report 92-41, Dept. of Mathematical Sciences, Rice University, Houston, TX 77251, USA (1992)."},{"key":"BF02206817_CR11","volume-title":"A quadratically convergent primal-dual algorithm for linear programming","author":"C.C. Gonzaga","year":"1993","unstructured":"C.C. Gonzaga and R.A. Tapia, A quadratically convergent primal-dual algorithm for linear programming, Technical Report, Dept. of Mathematical Sciences, Rice University, Houston, TX 77251, USA (1993)."},{"key":"BF02206817_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga, Path following methods for linear programming, SIAM Review 34(1992) 167\u2013227.","journal-title":"SIAM Review"},{"key":"BF02206817_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0167-6377(94)90075-2","volume":"15","author":"H.J. Greenberg","year":"1994","unstructured":"H.J. Greenberg, The use of the optimal partition in a linear programming solution for postoptimal analysis, Operations Research Letters, 15(1994)179\u2013186.","journal-title":"Operations Research Letters"},{"key":"BF02206817_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-1134-8","volume-title":"Interior Point Approach to Linear Quadratic and Convex Programming, Algorithms and Complexity","author":"D. Hertog den","year":"1994","unstructured":"D. den Hertog,Interior Point Approach to Linear Quadratic and Convex Programming, Algorithms and Complexity (Kluwer, Dordrecht, The Netherlands, 1994)."},{"key":"BF02206817_CR15","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1080\/02522667.1991.10699062","volume":"12","author":"D. Hertog den","year":"1991","unstructured":"D. den Hertog, C. Roos and T. Terlaky, A polynomial method of weighted centers for convex quadratic programming, Journal of Information and Optimization Sciences 12(1991)187\u2013205.","journal-title":"Journal of Information and Optimization Sciences"},{"key":"BF02206817_CR16","volume-title":"An interior point approach to postoptimal and parametric analysis in linear programming","author":"B. Jansen","year":"1992","unstructured":"B. Jansen, C. Roos and T. Terlaky, An interior point approach to postoptimal and parametric analysis in linear programming, Technical Report 92-21, Faculty of Technical Mathematics and Informatics, TU Delft, NL-2628 CD Delft, The Netherlands (1992)."},{"key":"BF02206817_CR17","volume-title":"A family of polynomial affine scaling algorithms for positive semi-definite linear complementarity problems","author":"B. Jansen","year":"1993","unstructured":"B. Jansen, C. Roos and T. Terlaky, A family of polynomial affine scaling algorithms for positive semi-definite linear complementarity problems, Technical Report 93-112, Faculty of Technical Mathematics and Informatics, TU Delft, NL-2600 GA Delft, The Netherlands (1993), to appear in SIAM Journal on Optimization."},{"key":"BF02206817_CR18","volume-title":"A polynomial primal-dual Dikin-type algorithm for linear programming","author":"B. Jansen","year":"1993","unstructured":"B. Jansen, C. Roos and T. Terlaky, A polynomial primal-dual Dikin-type algorithm for linear programming, Technical Report 93-36, Faculty of Technical Mathematics and Informatics, TU Delft, NL-2600 GA Delft, The Netherlands (1993), to appear in Mathematics of OR."},{"key":"BF02206817_CR19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1080\/02331939408843952","volume":"29","author":"B. Jansen","year":"1994","unstructured":"B. Jansen, C. Roos and T. Terlaky, The theory of linear programming: Skew symmetric self-dual problems and the central path, Optimization 29(1994)225\u2013233.","journal-title":"Optimization"},{"key":"BF02206817_CR20","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, Primal-dual algorithms for linear programming based on the logarithmic barrier method, Journal of Optimization Theory and Applications 83(1994)1\u201326.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02206817_CR21","volume-title":"Long-step primal-dual target-following algorithms for linear programming","author":"B. Jansen","year":"1994","unstructured":"B. Jansen, C. Roos, T. Terlaky and J.-Ph. Vial, Long-step primal-dual target-following algorithms for linear programming, Technial Report 94-46, Faculty of Technical Mathematics and Informatics, TU Delft, NL-2600 GA Delft, The Netherlands (1994), to appear in ZOR."},{"key":"BF02206817_CR22","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, volume 538 of Lecture Notes in Computer Science (Springer, Berlin, 1991)."},{"key":"BF02206817_CR23","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, A primal-dual interior point algorithm for linear programming, in:Progress in Mathematical Programming: Interior Point and Related Methods, ed. N. Megiddo (Springer, New York, 1989) pp. 29\u201347."},{"key":"BF02206817_CR24","doi-asserted-by":"crossref","first-page":"101","DOI":"10.2140\/pjm.1980.88.101","volume":"88","author":"L. McLinden","year":"1980","unstructured":"L. McLinden, The analogue of Moreau's proximation theorem, with applications to the nonlinear complementarity problem, Pacific Journal of Mathematics 88(1980)101\u2013161.","journal-title":"Pacific Journal of Mathematics"},{"key":"BF02206817_CR25","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, Pathways to the optimal set in linear programming, in:Progress in Mathematical Programming: Interior Point and Related Methods, ed. N. Megiddo (Springer, New York, 1989) pp. 131\u2013158."},{"key":"BF02206817_CR26","doi-asserted-by":"crossref","first-page":"66","DOI":"10.15807\/jorsj.33.66","volume":"33","author":"S. Mizuno","year":"1990","unstructured":"S. Mizuno, AnO(n 3 L) algorithm using a sequence for linear complementarity problems, Journal of the Operations Research Society of Japan 33(1990)66\u201375.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"BF02206817_CR27","first-page":"671","volume":"15","author":"S. Mizuno","year":"1990","unstructured":"S. Mizuno, A rank-one updating interior algorithm for linear programming, Arabian Journal for Science and Engineering 15(1990)671\u2013677.","journal-title":"Arabian Journal for Science and Engineering"},{"key":"BF02206817_CR28","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01580891","volume":"56","author":"S. Mizuno","year":"1992","unstructured":"S. Mizuno, A new polynomial time method for a linear complementarity problem, Mathematical Programming 56(1992)31\u201343.","journal-title":"Mathematical Programming"},{"key":"BF02206817_CR29","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S. Mizuno","year":"1993","unstructured":"S. Mizuno, M. J. Todd and Y. Ye, On adaptive step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research 18(1993)964\u2013981.","journal-title":"Mathematics of Operations Research"},{"key":"BF02206817_CR30","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, Interior path following primal-dual algorithms: Part I: Linear programming. Mathematical Programming 44(1989)27\u201341.","journal-title":"Mathematical Programming"},{"key":"BF02206817_CR31","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, Interior path following primal-dual algorithms: Part II: Convex quadratic programming, Mathematical Programming 44(1989)43\u201366.","journal-title":"Mathematical Programming"},{"key":"BF02206817_CR32","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R.D.C. Monteiro","year":"1990","unstructured":"R.D.C. Monteiro, I. Adler and M.G.C. Resende, A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension, Mathematics of Operations Research 15(1990)191\u2013214.","journal-title":"Mathematics of Operations Research"},{"key":"BF02206817_CR33","series-title":"Technical Report","volume-title":"Self-scaled cones and interior-point methods in nonlinear programming","author":"Y. Nesterov","year":"1993","unstructured":"Y. Nesterov and M.J. Todd, Self-scaled cones and interior-point methods in nonlinear programming, Technical Report, School of OR and IE, Cornell University, Ithaca, NY 14853 (1993), to appear in Mathematics of Operations Research."},{"key":"BF02206817_CR34","volume-title":"Combinatorial Optimization. Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization. Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982)."},{"key":"BF02206817_CR35","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, A polynomial-time algorithm, based on Newton's method, for linear programming, Mathematical Programming 40(1988)59\u201393.","journal-title":"Mathematical Programming"},{"key":"BF02206817_CR36","volume-title":"A polynomial method of approximate weighted centers for linear programming","author":"C. Roos","year":"1989","unstructured":"C. Roos and D. den Hertog, A polynomial method of approximate weighted centers for linear programming, Technical Report 89-13, Faculty of Mathematics and Informatics, TU Delft, NL-2628 BL Delft, The Netherlands (1989)."},{"key":"BF02206817_CR37","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01586056","volume":"54","author":"C. Roos","year":"1992","unstructured":"C. Roos and J.-Ph. Vial, A polynomial method of approximate centers for linear programming, Mathematical Programming 54(1992)295\u2013305.","journal-title":"Mathematical Programming"},{"key":"BF02206817_CR38","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, An $$O(\\sqrt {nL} )$$ -iteration homogeneous and self-dual linear programming algorithm, Mathematics of Operations Research 19(1994)53\u201367.","journal-title":"Mathematics of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02206817.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02206817\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02206817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T14:35:27Z","timestamp":1557844527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02206817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["BF02206817"],"URL":"https:\/\/doi.org\/10.1007\/bf02206817","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}