An interior point potential reduction method for constrained equations

Mathematical Programming, Series B

Volumn 74, Issue 2 PART A, 1996, Pages 159-195

  Wang, Tao ^a   Monteiro, Renato D C ^b   Pang, Jong Shi ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b Georgia Institute of Technology ^*  (United States)

Author keywords

Complementarity problem; Constrained equations; Convex programs; Interior point methods; Potential reduction; Variational inequality

Indexed keywords

EID: 0000304337     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02592210     Document Type: Article

References (60)

1. A. Ambrosetti and G. Prodi, A Primer of Nonlinear Analysis (Cambridge University Press, Cambridge, 1993).
2. D. Bayer and J.C. Lagarias, "The nonlinear geometry of linear programming I: Affine and projective trajectories," Transactions of the American Mathematical Society 314 (1989) 499-526.
3. D. Bayer and J.C. Lagarias, "The nonlinear geometry of linear programming II: Legendre transform coordinates and central trajectories," Transactions of the American Mathematical Society 314 (1989) 527-581.
4. J.F. Bonnans and C.C. Gonzaga, "Convergence of interior point algorithms for the monotone linear complementarity problem," manuscript, INRIA, Rocquencourt (1993).
5. R.S. Dembo, "A set of geometric programming test problems and their solutions," Mathematical Programming 10 (1976) 192-213.
6. J.E. Dennis Jr. and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983).
7. J. Dongarra, J.R. Bunch, C.B. Moler and G.W. Stewart, LINPACK Users Guide (SIAM, Philadelphia, CA, 1978).
8. A.V. Fiacco and A. Ghaemi, "Sensitivity analysis of a nonlinear water pollution control model using an upper Hudson River data base," Operations Research 30 (1982) 1-28.
9. A.V. Fiacco and A. Ghaemi, "A sensitivity and parametric bound analysis of an electric power generator GP model: optimal steam turbine exhaust annulus and condenser sizes," Serial T-437 (Department of Operations Research, The George Washington University, 1981).
10. A.V. Fiacco and G. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968); reprinted: SIAM Classics in Applied Mathematics, Vol. 4 (SIAM, Philadelphia, PA, 1990).
11. K.R. Frisch, "The logarithmic potential method of convex programming," Technical report, University Institute of Economics, Oslo, Norway (1955).
12. 3L.) operations, in: N. Megiddo, ed., Progress in Mathematical Programming - Interior Point and Related Methods (Springer, Berlin, 1989) pp. 1-28.
13. C. Gonzaga, "Path-following methods for linear programming," SIAM Review 34 (1992) 167-224.
14. N.I.M. Gould, "An algorithm for large-scale quadratic programming," IMA Journal of Numerical Analysis 11 (1991) 299-324.
15. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes (Springer, Berlin, 1981).
16. A.J. Hoffman, "On approximate solutions of systems of linear inequalities," Journal of Research of the National Bureau of Standards 49 (1952) 263-265.
17. J. Ji, F. Potra, R.A. Tapia and Y. Zhang, "An interior-point method with polynomial complexity and superlinear convergence of linear complementarity problems," Technical report 91-23, Department of Mathematical Sciences, Rice University (1991).
18. N. Karmarkar, "A new polynomial algorithm for linear programming," Combinatorica 4 (1984) 373-395.
19. M. Kojima, N. Megiddo, and S. Mizuno, "A primal-dual infeasible-interior-point algorithm for linear programming," Mathematical Programming 61 (1993) 263-280.
20. M. Kojima, N. Megiddo and T. Noma, "Homotopy continuation methods for nonlinear complementarity problems," Mathematics of Operations Research 16 (1991) 754-774.
21. 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).
22. M. Kojima, N. Megiddo and Y. Ye, "An interior point potential reduction algorithm for the linear complementarity problem," Mathematical Programming 54 (1992) 267-279.
23. M. Kojima, S. Mizuno and A. Yoshise, A primal-dual interior-point method for linear programming, in: N. Megiddo, ed., Progress in Mathematical Programming - Interior Point and Related Methods (Springer, Berlin, 1989) 29-47.
24. M. Kojima, S. Mizuno and A. Yoshise, "An O(√nL) iteration potential reduction algorithm for linear complementarity problems,√ Mathematical Programming 50 (1991) 331-342.
25. M. Kojima, T. Noma and A. Yoshise, "Global convergence in infeasible interior-point algorithms," Mathematical Programming 65 (1994) 43-72.
26. K.O. Kortanek and H. No, "A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier," Optimization 23 (1992) 303-322.
27. I.J. Lustig, "Feasibility issues in a primal-dual interior-point method for linear programming," Mathematical Programming 49 (1990/1991) 145-162.
28. I.J. Lustig, R. Marsten and D. Shanno, "An implementation of a primal-dual interior point method for linear programming," Linear Algebra and its Applications 152 (1991) 191-222.
29. I.J. Lustig, R. Marsten and D. Shanno, "Interior point methods for linear programming: Computational state of the art," ORSA Journal on Computing 6 (1994) 1-14.
30. O.L. Mangasarian and J.S. Pang, "The extended linear complementarity problem," SIAM Journal on Matrix Analysis and Applications, to appear.
31. L. McLinden, "The complementarity problem for maximal monotone multifunction," in: R.W. Cottle, F. Giannessi and J.L. Lions, eds., Variational Inequalities and Complementarity Problems (Wiley, New York, 1980) 251-270.
32. N. Megiddo, "Pathways to the optimal set in linear programming," in: N. Megiddo, ed., Progress in Mathematical Programming - Interior Point and Related Methods, (Springer, Berlin, 1989) 131-158.
33. 3L) long step path following algorithm for a linear complementarity problem," Technical report No. 23, Department of Industrial Engineering and Management, Tokyo Institute of Technology (1989).
34. R.D.C. Monteiro, "A globally convergent primal-dual interior point algorithm for convex programming," Mathematical Programming 64 (1994) 123-147.
35. R.D.C. Monteiro and I. Adler, "Interior path following primal-dual algorithms. Part I: linear programming," Mathematical Programming 44 (1989) 27-41.
36. R.D.C. Monteiro and J.S. Pang, "Properties of an interior point mapping for mixed complementarity problems," Mathematics of Operations Research, to appear.
37. 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.
38. R.D.C. Monteiro and T. Tsuchiya, "Limiting behavior of the derivatives of certain trajectory associated with a monotone horizontal linear complementarity problem," manuscript, Department of Systems and Industrial Engineering, University of Arizona (1992).
39. Y.E. Nesterov and A.S. Nemirovsky, Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms (SIAM, Philadelphia, PA, 1994).
40. J.M. Ortega and W.C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, San Diego, CA, 1970).
41. J.S. Pang, "Complementarity problems," in: P. Pardalos and R. Horst, eds., Handbook of Global Optimization (Kluwer, 1995) 271-338.
42. F.A. Potra, "An infeasible interior-point predictor-corrector algorithm for linear programming," SIAM Journal on Optimization, to appear.
43. F.A. Potra and Y. Ye, "Interior point methods for nonlinear complementarity problems," Journal of Optimization Theory and Applications to appear.
44. J. Renegar, A polynomial-time algorithm based on Newton's method for linear programming, Mathematical Programming 40 (1988) 59-94.
45. M.J. Rijckaert and X.M. Martens, "Comparison of generalized geometric programming algorithms," in: M. Avriel, ed., Advances in Geometric Programming (Plenum, New York, 1980) 283-320.
46. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
47. G. Sonnevend, "An "analytical centre" for polyhedrons and new class of global algorithms for linear (smooth, convex) programming," in: Lecture Notes in Control and Information Sciences, Vol. 84 (Springer, New York, 1985) pp. 866-876.
48. M.J. Todd, "Theory and practice for interior-point methods," ORSA Journal on Computing 6 (1994) 28-31.
49. M.J. Todd and Y. Ye, "A centered projective algorithm for linear programming," Mathematics of Operations Research 15 (1990) 508-529.
50. J.C. Trinkle, J.S. Pang, S. Sudarsky and G. Lo, "On dynamic multi-rigid-body contact problems with Coulomb friction," manuscript. Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD (1995).
51. R.J. Vanderbei, "Symmetric quasidefinite matrices," SIAM Journal on Optimization 5 (1995) 100-113.
52. J.-P. Vial, "Computational experience with a primal-dual interior-point method for smooth convex programming," University of Geneva (1992).
53. S. Wright, "An infeasible interior point algorithm for linear complementarity problems," Technical report MCS-P331-1092, Mathematics and Computer Science Division, Argonne National Laboratory (1992).
54. S. Wright and D. Ralph, "A superlinear infeasible interior point algorithm for monotone nonlinear complementarity problems," Technical report MCS-P344-1292, Mathematics and Computer Science Division, Argonne National Laboratory (1993).
55. 3L) potential reduction algorithm for linear programming," Mathematical Programming 50 (1991) 239-258.
56. Y. Ye, "A fully polynomial-time approximation algorithm for computing a stationary point of the general linear complementarity problem," Mathematics of Operations Research 18 (1993) 334-345.
57. Y. Ye and K. Anstreicher, "On quadratic and O(√n L) convergence of a predictor-corrector algorithm for LCP," Mathematical Programming 62 (1993) 537-551.
58. Y. Ye and P. Pardalos, "A class of linear complementarity problems solvable in polynomial time," Linear Algebra and its Applications 152 (1991) 3-17.
59. Y. Zhang, "On the convergence of an infeasible interior-point algorithm for linear programming and other problems," SIAM Journal on Optimization 4 (1994) 208-227.
60. Y. Zhang, R. Tapia and F. Potra, "On the superlinear convergence of interior point algorithms for a general class of problems," SIAM Journal on Optimization 3 (1993) 413-422.