{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:08:39Z","timestamp":1761894519290},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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,9]]},"DOI":"10.1007\/bf02614359","type":"journal-article","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T04:29:49Z","timestamp":1177734589000},"page":"315-345","source":"Crossref","is-referenced-by-count":5,"title":["Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems"],"prefix":"10.1007","volume":"78","author":[{"given":"Benjamin","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kees","family":"Roos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akiko","family":"Yoshise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02614359_CR1","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/0805013","volume":"5","author":"K.M. Anstreicher","year":"1995","unstructured":"K.M. Anstreicher and R. Bosch, A new infinity-norm path following algorithm for linear programming,SIAM Journal on Optimization 5 (1995) 236\u2013246.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02614359_CR2","volume-title":"The Linear Complementarity Problem, Computer Science and Scientific Computing","author":"R.W. Cottle","year":"1992","unstructured":"R.W. Cottle, J.S. Pang and R.E. Stone,The Linear Complementarity Problem, Computer Science and Scientific Computing (Academic Press, San Diego, 1992)."},{"key":"BF02614359_CR3","first-page":"747","volume":"174","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, Iterative solution of problems of linear and quadratic programming,Doklady Akademii Nauk SSSR 174 (1967) 747\u2013748. [Translated in:Soviet Mathematics Doklady 8 (1967) 674\u2013675.]","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"BF02614359_CR4","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.20.2.415","volume":"20","author":"R.M. Freund","year":"1995","unstructured":"R.M. Freund and M.J. Todd, Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables,Mathematics of Operations Research 20 (1995) 415\u2013440.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614359_CR5","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":"BF02614359_CR6","unstructured":"O. G\u00fcler, Path following and potential reduction algorithms for nonlinear monotone complementarity problems. Working Paper, Dept. of Management Science, University of Iowa, Iowa City, 1991."},{"key":"BF02614359_CR7","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1287\/moor.18.1.128","volume":"18","author":"O. G\u00fcler","year":"1993","unstructured":"O. G\u00fcler, Existence of interior points and interior paths in nonlinear monotone complementarity problems,Mathematics of Operations Research 18 (1993) 128\u2013147.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614359_CR8","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/moor.20.2.441","volume":"20","author":"O. G\u00fcler","year":"1995","unstructured":"O. G\u00fcler, Generalized linear complementarity problems,Mathematics of Operations Research 20 (1995) 441\u2013448.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614359_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01582255","volume":"48","author":"P.T. Harker","year":"1990","unstructured":"P.T. Harker and J.S. Pang, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications,Mathematical Programming 48 (1990) 161\u2013220.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR10","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 Academic Publishers, Dordrecht, The Netherlands, 1994)."},{"key":"BF02614359_CR11","first-page":"75","volume":"69","author":"D. Hertog den","year":"1995","unstructured":"D. den Hertog, F. Jarre, C. Roos and T. Terlaky, A sufficient condition for self-concordance, with application to some classes of structured convex programming,Mathematical Programming 69 (1995) 75\u201388.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00940075","volume":"73","author":"D. Hertog den","year":"1992","unstructured":"D. den Hertog, C. Roos and T. Terlaky, On the classical logarithmic barrier function method for a class of smooth convex programming problems,Journal of Optimization Theory and Applications 73 (1992) 1\u201325.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02614359_CR13","series-title":"Technical Report","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 Computer Science, Delft University of Technology, Delft, The Netherlands, 1993; also:SIAM Journal on Optimization 7 (1997) 126\u2013140."},{"key":"BF02614359_CR14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/moor.21.2.341","volume":"21","author":"B. Jansen","year":"1996","unstructured":"B. Jansen, C. Roos and T. Terlaky, A polynomial primal-dual Dikin-type algorithm for linear programming,Mathematics of Operations Research 21 (1996) 341\u2013353.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614359_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0083587","volume-title":"The method of analytic centers for smooth convex programs","author":"F. Jarre","year":"1989","unstructured":"F. Jarre, The method of analytic centers for smooth convex programs, Ph.D. Thesis, Institut f\u00fcr Angewandte Mathematik und Statistik, Universit\u00e4t W\u00fcrzburg, W\u00fcrzburg, Germany, 1989."},{"key":"BF02614359_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF01371086","volume":"26","author":"F. Jarre","year":"1992","unstructured":"F. Jarre, Interior-point methods for convex programming,Applied Mathematics & Optimization 26 (1992) 287\u2013311.","journal-title":"Applied Mathematics & Optimization"},{"key":"BF02614359_CR17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1080\/10556789508805603","volume":"5","author":"F. Jarre","year":"1995","unstructured":"F. Jarre, Interior-point methods via self-concordance or relative Lipschitz condition,Optimization Methods and Software 5 (1995) 75\u2013104.","journal-title":"Optimization Methods and Software"},{"key":"BF02614359_CR18","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/0803018","volume":"3","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, Y. Kurita and S. Mizuno, Large-step interior point algorithms for linear complementarity problems,SIAM Journal on Optimization 3 (1993) 398\u2013412.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02614359_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01581234","volume":"59","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo and S. Mizuno, Theoretical convergence of large-step-primal-dual interior point algorithms for linear programming,Mathematical Programming 59 (1993) 1\u201321.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR20","volume-title":"Vol. 538 of Lecture Notes in Computer Science, Vol. 538","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, Vol. 538 of Lecture Notes in Computer Science, Vol. 538 (Springer, Berlin, 1991)."},{"key":"BF02614359_CR21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01586054","volume":"54","author":"M. Kojima","year":"1992","unstructured":"M. Kojima, N. Megiddo and Y. Ye, An interior point potential reduction algorithm for the linear complementarity problem,Mathematical Programming 54 (1992) 267\u2013279.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR22","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01582283","volume":"43","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and T. Noma, A new continuation method for complementarity problems with uniformP-functions,Mathematical Programming 43 (1989) 107\u2013113.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR23","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/moor.15.4.662","volume":"15","author":"M. Kojima","year":"1990","unstructured":"M. Kojima, S. Mizuno and T. Noma, Limiting behavior of trajectories by a continuation method for monotone complementarity problems,Mathematics of Operations Research 15 (1990) 662\u2013675.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614359_CR24","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, A polynomial-time algorithm for a class of linear complementarity problems,Mathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR25","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: N. Megiddo, ed.,Progress in Mathematical Programming: Interior Point and Related Methods (Springer, New York, 1989) 29\u201347."},{"key":"BF02614359_CR26","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, An O(\u221anL) iteration potential reduction algorithm for linear complementarity problems,Mathematical Programming 50 (1991) 331\u2013342.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR27","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01581689","volume":"65","author":"M. Kojima","year":"1994","unstructured":"M. Kojima, T. Noma and A. Yoshise, Global convergence in infeasible-interior-point algorithms,Mathematical Programming 65 (1994) 43\u201372.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR28","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0024-3795(91)90274-Z","volume":"152","author":"K.O. Kortanek","year":"1991","unstructured":"K.O. Kortanek, F. Potra and Y. Ye. On some efficient interior point methods for nonlinear convex programming,Linear Algebra and Its Applications 152 (1991) 169\u2013189.","journal-title":"Linear Algebra and Its Applications"},{"key":"BF02614359_CR29","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/moor.18.1.116","volume":"18","author":"K.O. Kortanek","year":"1993","unstructured":"K.O. Kortanek and J. Zhu, A polynomial barrier algorithm for linearly constrained convex programming problems,Mathematics of Operations Research 18 (1993) 116\u2013127.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614359_CR30","unstructured":"P. Ling, A new proof of convergence for the new primal-dual affine scaling interior-point algorithm of Jansen, Roos and Terlaky, Technical Report SYS-C93-09, School of Information Systems, University of East-Anglia, Norwich, 1993."},{"key":"BF02614359_CR31","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\u2019s proximation theorem, with applications to the nonlinear complementarity problem,Pacific Journal of Mathematics 88 (1980) 101\u2013161.","journal-title":"Pacific Journal of Mathematics"},{"key":"BF02614359_CR32","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0024-3795(91)90273-Y","volume":"152","author":"S. Mizuno","year":"1991","unstructured":"S. Mizuno, O(n pL) iteration O(n 3L) potential reduction algorithms for linear programming,Linear Algebra and Its Applications 152 (1991) 155\u2013168.","journal-title":"Linear Algebra and Its Applications"},{"key":"BF02614359_CR33","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/BF01582906","volume":"52","author":"S. Mizuno","year":"1991","unstructured":"S. Mizuno and M.J. Todd, An O(n 3L) adaptive path following algorithm for a linear complementarity problem,Mathematical Programming 52 (1991) 587\u2013595.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR34","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":"BF02614359_CR35","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":"BF02614359_CR36","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/moor.15.3.408","volume":"15","author":"R.D.C. Monteiro","year":"1990","unstructured":"R.D.C. Monteiro and I. Adler, An extension of Karmarkar-type algorithm to a class of convex separable programming problems with global linear rate of convergence,Mathematics of Operations Research 15 (1990) 408\u2013422.","journal-title":"Mathematics of Operations Research"},{"key":"BF02614359_CR37","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":"BF02614359_CR38","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/0805007","volume":"5","author":"R.D.C. Monteiro","year":"1995","unstructured":"R.D.C. Monteiro, J.-S. Pang and T. Wang, A positive algorithm for the nonlinear complementarity problem,SIAM Journal on Optimization 5 (1995) 129\u2013148.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02614359_CR39","series-title":"Technical Report","volume-title":"Long-step strategies in interior point potential reduction methods","author":"Y. Nesterov","year":"1993","unstructured":"Y. Nesterov, Long-step strategies in interior point potential reduction methods, Technical Report, University of Geneva, Geneva, Switzerland, 1993."},{"key":"BF02614359_CR40","volume-title":"SIAM Studies in Applied Mathematics, Vol. 13","author":"Y. Nesterov","year":"1994","unstructured":"Y. Nesterov and A.S. Nemirovsky,Interior Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, Vol. 13 (SIAM, Philadelphia, PA, 1994)."},{"key":"BF02614359_CR41","series-title":"Technical Report","volume-title":"Self-scaled barriers and interior-point methods for convex programming","author":"Y. Nesterov","year":"1994","unstructured":"Y. Nesterov and M.J. Todd, Self-scaled barriers and interior-point methods for convex programming, Technical Report 1091, School of OR and IE, Cornell University, Ithaca, NY, 1994; also:Mathematics of Operations Research 22 (1997) 1\u201342."},{"key":"BF02614359_CR42","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01580617","volume":"60","author":"J.S. Pang","year":"1993","unstructured":"J.S. Pang and S.A. Gabriel, NE\/SQP: A robust algorithm for the nonlinear complementarity problem,Mathematical Programming 60 (1993) 295\u2013337.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR43","series-title":"Reports on Computational Mathematics","volume-title":"Interior point methods for nonlinear complementarity problems","author":"F.A. Potra","year":"1991","unstructured":"F.A. Potra and Y. Ye, Interior point methods for nonlinear complementarity problems, Reports on Computational Mathematics 15, Dept. of Mathematics, The University of Iowa, Iowa City, 1991; also:Journal of Optimization Theory and Applications, to appear."},{"key":"BF02614359_CR44","series-title":"Technical Report","volume-title":"A predictor-corrector algorithm for a class of nonlinear saddle point problems","author":"J. Sun","year":"1994","unstructured":"J. Sun, J. Zhu and G. Zhao, A predictor-corrector algorithm for a class of nonlinear saddle point problems. Technical Report, National University of Singapore, Singapore, 1994."},{"key":"BF02614359_CR45","series-title":"Technical Report","volume-title":"A quadratically convergent polynomial-step algorithm for a class of nonlinear monotone complementarity problems","author":"J. Sun","year":"1995","unstructured":"J. Sun and G. Zhao, A quadratically convergent polynomial-step algorithm for a class of nonlinear monotone complementarity problems, Technical Report, Dept. of Decision Sciences, National University of Singapore, Singapore, 1995."},{"key":"BF02614359_CR46","series-title":"Research Report","volume-title":"P * matrices are just sufficient","author":"H. V\u00e4liaho","year":"1994","unstructured":"H. V\u00e4liaho,P * matrices are just sufficient, Research Report, Department of Mathematics, University of Helsinki, Helsinki, 1994; also:Linear Algebra and Its Applications 239 (1996) 103\u2013108."},{"key":"BF02614359_CR47","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1080\/10556789308805537","volume":"2","author":"S.J. Wright","year":"1993","unstructured":"S.J. Wright, A path-following infeasible-interior-point algorithm for linear complementarity problems,Optimization Methods and Software 2 (1993) 79\u2013106.","journal-title":"Optimization Methods and Software"},{"key":"BF02614359_CR48","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00941467","volume":"75","author":"P. Tseng","year":"1992","unstructured":"P. Tseng, Global linear convergence of a path following algorithm for some variational inequality problems,Journal of Optimization Theory and Applications 75 (1992) 265\u2013279.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02614359_CR49","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, On quadratic and O(\u221anL) convergence of predictor-corrector algorithms for LCP,Mathematical Programming 62 (1993) 537\u2013551.","journal-title":"Mathematical Programming"},{"key":"BF02614359_CR50","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0024-3795(91)90264-W","volume":"152","author":"Y. Ye","year":"1991","unstructured":"Y. Ye and P.M. Pardalos, A class of linear complementarity problems solvable in polynomial time,Linear Algebra and Its Applications 152 (1991) 3\u201317.","journal-title":"Linear Algebra and Its Applications"},{"key":"BF02614359_CR51","first-page":"359","volume":"36","author":"J. Zhu","year":"1992","unstructured":"J. Zhu, A path following algorithm for a class of convex programming problems,Zeitschrift f\u00fcr Operations Research 36 (1992) 359\u2013377.","journal-title":"Zeitschrift f\u00fcr Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614359.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02614359\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02614359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:49:24Z","timestamp":1558342164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02614359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["BF02614359"],"URL":"https:\/\/doi.org\/10.1007\/bf02614359","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}