Interior-point methods for nonlinear complementarity problems

DOI10.1007/BF02192201zbMath0851.90122MaRDI QIDQ1918290

Yinyu Ye, Florian A. Potra

Publication date: 31 July 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

convergence rates; potential reduction interior-point algorithm; monotone nonlinear complementarity

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

An inexact interior point method for monotone NCP, An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps, Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems, Global convergence in infeasible-interior-point algorithms, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, Inexact interior-point method, Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems., An interior point potential reduction method for constrained equations, Global convergence enhancement of classical linesearch interior point methods for MCPs, A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*, Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the finite convergence of interior-point algorithms for linear programming
• Convergence behavior of interior-point algorithms
• A new continuation method for complementarity problems with uniform P- functions
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• On some efficient interior point methods for nonlinear convex programming
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
• Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
• A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
• Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems