An infeasible-interior-point method for linear complementarity problems

SIAM Journal on Optimization

Volumn 7, Issue 3, 1997, Pages 620-640

  Simantiraki, Evangelia M ^a   Shanno, David F ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Interior point methods; Linear complementarity

Indexed keywords

EID: 0031285894     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495282882     Document Type: Article

References (28)

1. R. COTTLE, J. S. PANG, AND R. E. STONE, The Linear Complementarity Problem, Academic Press, New York, San Diego, 1992.
2. T. A. DAVIS, Users' Guide for the Unsymmetric-Pattern Multifrontal Package (UMFPACK), Technical report, Computer and Information Sciences Department, University of Florida, Gainesville, FL, 1993.
3. J. E. DENNIS AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
4. A. S. EL-BAKRY, R. A. TAPIA, T. TSUCHIYA, AND Y. ZHANG, On the Formulation and Theory of the Primal-Dual Newton Interior-Point Method for Nonlinear Programming, Technical report TR92-40, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1992.
5. L. FERNANDES, J. JÚDICE, AND J. PATRÍCIO, An Investigation of Interior-Point and Block Pivoting Algorithms for Large-Scale Symmetric Monotone Linear Complementarity Problems, Research report, Department of Mathematics, University of Coimbra, Portugal, 1994.
6. P. HARKER AND J. PANG, A damped-Newton method for the linear complementarity problem, in Simulation and Optimization of Large Systems, G. Allgower and K. Georg, eds., Lectures in Applied Mathematics 26, American Mathematical Society, Providence, RI, 1990, pp. 265-284.
7. W. HOCK AND K. SCHITTKOWSKI, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems 187, Springer-Verlag, Berlin, Germany, 1981.
8. C. KANZOW, A New Approach to Continuation Methods for Complementarity Problems with P-Functions, Research report, Institute of Applied Mathematics, University of Hamburg, Germany, 1994.
9. M. KOJIMA, N. MEGIDDO, AND S. MIZUNO, A primal-dual infeasible-interior-point algorithm for linear programming, Math. Programming, 61 (1993), pp. 263-280.
10. 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 538, Springer-Verlag, Berlin, Germany, 1991.
11. M. KOJIMA, T. NOMA, AND A. YOSHISE, Global convergence in infeasible-interior-point algorithms, Math. Programming, 65 (1994), pp. 43-72.
12. E. MASKIN AND J. TIROLE, A theory of dynamic oligopoly, II: Price competition, kinked demand curves, and edgeworth cycles, Econometrica, 56 (1988), pp. 571-579.
13. J. MIAO, A quadratically convergent O((1 + k) √nl)-iteration algorithm for the P*(k)-matrix linear complementarity problem, Math. Programming, 69 (1995), pp. 355-368.
14. S. MIZUNO, Polynomiality of infeasible-interior-point algorithms for linear programming, Math. Programming, 67 (1994), pp. 109-119.
15. K. G. MURTY, Linear Complementarity, Linear and Nonlinear Programming, Sigma Series in Applied Mathematics 3, Heldermann Verlag, Berlin, Germany, 1988.
16. J.-S. PANG AND P. S. C. LEE, A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity model, Math. Programming, 20 (1981), pp. 81-102.
17. L. PORTUGAL AND J. JÚDICE, A Hybrid Algorithm for the Solution of a Single Commodity Spatial Equilibrium Model, Research report, Department of Mathematics, University of Coimbra, Portugal, 1994.
18. F. POTRA AND R. SHENG, A Large-Step Infeasible-Interior-Point Method for the P*(k)-Matrix LCP, Reports on Computational Mathematics 64, Department of Mathematics, The University of Iowa, Iowa City, IA, 1994.
19. F. A. POTRA, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, Math. Programming, 67 (1994), pp. 383-406.
20. F. A. POTRA AND R. SHENG, Predictor-Corrector Algorithms for Solving P*(k)-Matrix LCP from Arbitrary Positive Starting Points, Reports on Computational Mathematics 58, Department of Mathematics, The University of Iowa, Iowa City, IA, 1994.
21. F. A. POTRA AND R. SHENG, A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Degenerate LCP, Reports on Computational Mathematics 66, Department of Mathematics, The University of Iowa, Iowa City, IA, 1995.
22. D. F. SHANNO, Computational Experience with Logarithmic Barrier Methods for Linear and Nonlinear Complementarity Problems, Rutcor Research report 18-93, RUTCOR, New Brunswick, NJ, 1993.
23. E. SIMANTIRAKI AND D. SHANNO, Computing Equilibria of Oligopolistic Pricing Models, Rutcor Research report 41-95, RUTCOR and Graduate School of Management, Rutgers University, New Brunswick, NJ, 1995.
24. E. SIMANTIRAKI AND D. SHANNO, An Infeasible-Interior-Point Algorithm for Solving Mixed Complementarity Problems, Rutcor Research report 37-95, RUTCOR and Graduate School of Management, Rutgers University, New Brunswick, NJ, 1995.
25. S. J. WRIGHT, An infeasible-interior-point algorithm for linear complementarity problems, Math. Programming, 67 (1994), pp. 29-51.
26. Y. YE, A further result on the potential reduction algorithm for the P-matrix linear complementarity problem, in Advances in Optimization and Parallel Computing, P.M. Pardalos, ed., Elsevier Science Publishers B.V., New York, 1992, pp. 311-316.
27. Y. ZHANG, On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem, SIAM J. Optim., 4 (1994), pp. 208-227.
28. Y. ZHANG AND R. A. TAPIA, A superlinearly convergent polynomial primal-dual interior-point algorithm for linear programming, SIAM J. Optim., 3 (1993), pp. 118-133.