Polynomiality of primal - dual affine scaling algorithms for nonlinear complementarity problems

Mathematical Programming, Series B

Volumn 78, Issue 3, 1997, Pages 315-345

  Jansen, Benjamin ^a   Roos, Kees ^a   Terlaky, Tamás ^a   Yoshise, Akiko ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Complementarity problems; Global convergence; Interior point methods; Polynomial time convergence; Primal dual affine scaling methods; Smoothness conditions

Indexed keywords

EID: 0009139498     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614359     Document Type: Article

References (56)

1. K.M. Anstreicher and R. Bosch, A new infinity-norm path following algorithm for linear programming, SIAM Journal on Optimization 5 (1995) 236-246.
2. R.W. Cottle, J.S. Pang and R.E. Stone, The Linear Complementarity Problem. Computer Science and Scientific Computing (Academic Press, San Diego, 1992).
3. I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Doklady Akademii Nauk SSSR 174 (1967) 747-748. [Translated in: Soviet Mathematics Doklady 8 (1967) 674-675.]
4. I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Doklady Akademii Nauk SSSR 174 (1967) 747-748. [Translated in: Soviet Mathematics Doklady 8 (1967) 674-675.]
5. 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-440.
6. C.C. Gonzaga, Path following methods for linear programming, SIAM Review 34 (1992) 167-227.
7. O. Güler, Path following and potential reduction algorithms for nonlinear monotone complementarity problems, Working Paper, Dept. of Management Science, University of Iowa, Iowa City, 1991.
8. O. Güler, Existence of interior points and interior paths in nonlinear monotone complementarity problems, Mathematics of Operations Research 18(1993) 128-147.
9. O. Güler, Generalized linear complementarity problems, Mathematics of Operations Research 20 (1995) 441-448.
10. 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-220.
11. D. den Hertog, Interior Point Approach to Linear, Quadratic and Convex Programming, Algorithms and Complexity (Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994).
12. 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-88.
13. 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-25.
14. 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 1 (1997) 126-140.
15. 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 1 (1997) 126-140.
16. B. Jansen, C. Roos and T. Terlaky, A polynomial primal-dual Dikin-type algorithm for linear programming, Mathematics of Operations Research 21 (1996) 341-353.
17. F. Jarre, The method of analytic centers for smooth convex programs, Ph.D. Thesis, Institut für Angewandte Mathematik und Statistik, Universität Würzburg, Würzburg, Germany, 1989.
18. F. Jarre, Interior-point methods for convex programming, Applied Mathematics & Optimization 26 (1992) 287-311.
19. F. Jarre, Interior-point methods via self-concordance or relative Lipschitz condition. Optimization Methods and Software 5 (1995) 75-104.
20. M. Kojima, Y. Kurita and S. Mizuno, Large-step interior point algorithms for linear complementarity problems, SIAM Journal on Optimization 3 (1993) 398-412.
21. 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-21.
22. 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).
23. M. Kojima, N. Megiddo and Y. Ye, An interior point potential reduction algorithm for the linear complementarity problem, Mathematical Programming 54 (1992) 267-279.
24. M. Kojima, S. Mizuno and T. Noma, A new continuation method for complementarity problems with uniform P-functions, Mathematical Programming 43 (1989) 107-113.
25. 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-675.
26. M. Kojima, S. Mizuno and A. Yoshise, A polynomial-time algorithm for a class of linear complementarity problems. Mathematical Programming 44 (1989) 1-26.
27. 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-47.
28. M. Kojima, S. Mizuno and A. Yoshise, An O(√nL) iteration potential reduction algorithm for linear complementarity problems, Mathematical Programming 50(1991) 331-342.
29. M. Kojima, T. Noma and A. Yoshise, Global convergence in infeasible-interior-point algorithms. Mathematical Programming 65 (1994) 43-72.
30. 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-189.
31. K.O. Kortanek and J. Zhu, A polynomial barrier algorithm for linearly constrained convex programming problems. Mathematics of Operations Research 18 (1993) 116-127.
32. 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.
33. L. McLinden, The analogue of Moreau's proximation theorem, with applications to the nonlinear complementarity problem, Pacific Journal of Mathematics 88 (1980) 101-161.
34. 3L) potential reduction algorithms for linear programming, Linear Algebra and Its Applications 152 (1991) 155-168.
35. 3L) adaptive path following algorithm for a linear complementarity problem, Mathematical Programming 52 (1991) 587-595.
36. R.D.C. Monteiro and I. Adler, Interior path following primal - dual algorithms: Part I: Linear programming, Mathematical Programming 44 (1989) 27-41.
37. R.D.C. Monteiro and I. Adler, Interior path following primal - dual algorithms: Part II: Convex quadratic programming, Mathematical Programming 44 (1989) 43-66.
38. 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-422.
39. 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-214.
40. 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-148.
41. Y. Nesterov, Long-step strategies in interior point potential reduction methods, Technical Report, University of Geneva, Geneva, Switzerland, 1993.
42. Y. Nesterov and A.S. Nemirovsky, Interior Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, Vol. 13 (SIAM, Philadelphia, PA, 1994).
43. 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-42.
44. 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-42.
45. J.S. Pang and S.A. Gabriel, NE/SQP: A robust algorithm for the nonlinear complementarity problem, Mathematical Programming 60 (1993) 295-337.
46. 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 ami Applications, to appear.
47. 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 ami Applications, to appear.
48. 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.
49. 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.
50. H. Väliaho, P* matrices are just sufficient, Research Report, Department of Mathematics, University of Helsinki, Helsinki, 1994; also: Linear Algebra and Its Applications 239 (1996) 103-108.
51. H. Väliaho, P* matrices are just sufficient, Research Report, Department of Mathematics, University of Helsinki, Helsinki, 1994; also: Linear Algebra and Its Applications 239 (1996) 103-108.
52. S.J. Wright, A path-following infeasible-interior-point algorithm for linear complementarity problems, Optimization Methods and Software 2 (1993) 79-106.
53. P. Tseng, Global linear convergence of a path following algorithm for some variational inequality problems, Journal of Optimization Theory and Applications 75 (1992) 265-279.
54. Y. Ye and K.M. Anstreicher, On quadratic and O(√nL) convergence of predictor-corrector algorithms for LCP, Mathematical Programming 62 (1993) 537-551.
55. Y. Ye and P.M. Pardalos, A class of linear complementarity problems solvable in polynomial time, Linear Algebra and Its Applications 152 (1991) 3-17.
56. J. Zhu, A path following algorithm for a class of convex programming problems, Zeitschrift für Operations Research 36 (1992) 359-377.