Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/taylor-francis/an-inexact-interior-point-method-for-monotone-ncp-6dxko0RDyy
References (16)
-
Stephen Wright, D. Ralph (1996)
A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity ProblemsMath. Oper. Res., 21
-
R. Dembo, S. Eisenstat, T. Steihaug (1982)
INEXACT NEWTON METHODSSIAM Journal on Numerical Analysis, 19
-
Jie Sun, G. Zhao (1998)
Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality ProblemsSIAM J. Optim., 8
-
F. Potra, Y. Ye (1996)
Interior-point methods for nonlinear complementarity problemsJournal of Optimization Theory and Applications, 88
-
S. Bellavia (1998)
Inexact Interior-Point MethodJournal of Optimization Theory and Applications, 96
-
S. Eisenstat, H. Walker (1994)
Globally Convergent Inexact Newton MethodsSIAM J. Optim., 4
-
P. Tseng (1997)
An Infeasible Path-Following Method for Monotone Complementarity ProblemsSIAM J. Optim., 7
-
L. Portugal, M. Resende, G. Veiga, J. Júdice (2000)
A truncated primal‐infeasible dual‐feasible network interior point methodNetworks, 35
-
M. Kojima, Toshihito Noma, Akiko Yoshise (1994)
Global convergence in infeasible-interior-point algorithmsMathematical Programming, 65
-
G. Isac (1992)
Complementarity Problems -
R. Murphy (1994)
Iterative solution of nonlinear equationsJournal of Computers in Mathematics and Science Teaching archive, 13
-
M. Ferris, J. Pang (1997)
Engineering and Economic Applications of Complementarity ProblemsSIAM Rev., 39
-
J. Bonnans, C. Pola, Raja Rébaï (1995)
Perturbed Path Following Interior Point Algorithms -
Rongqin Sheng, F. Potra (1997)
A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial ComplexitySIAM J. Optim., 7
-
J. Ortega, W. Rheinboldt (2014)
Iterative solution of nonlinear equations in several variables -
R. Freund, F. Jarre (1997)
A QMR-based interior-point algorithm for solving linear programsMathematical Programming, 76
- Publisher
- Taylor & Francis
- Copyright
- Copyright Taylor & Francis Group, LLC
- ISSN
- 1029-4937
- eISSN
- 1055-6788
- DOI
- 10.1080/10556789908805752
- Publisher site
- See Article on Publisher Site
Abstract
In this paper we present an inexact Interior Point method for solving monotone nonlinear complementarity problems. We show that the theory presented by Kojima, Noma and Yoshise for an exact version of this method can be used to establish global convergence for the inexact form. Then we prove that local superlinear convergence can be achieved under some stronger hypotheses. The complexity of the algorithm is also studied under the assumption that the problem satisfies a scaled Lipschitz condition. It is proved that the feasible version of the algorithm is polynomial, while the infeasible one is globally convergent at a linear rate.
Journal
Optimization Methods and Software – Taylor & Francis
Published: Jan 1, 1999
Keywords: inexact interior point; nonlinear complementarity problems; polynomial complexity; rate of convergence