Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
From MaRDI portal
Publication:1366422
DOI10.1007/BF02614359zbMath0889.90138OpenAlexW1982718164MaRDI QIDQ1366422
Akiko Yoshise, Tamás Terlaky, Kees Roos, Benjamin Jansen
Publication date: 10 September 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614359
Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A new path-following algorithm for nonlinear \(P_*\) complementarity problems, Interior point algorithm for \(P_*\) nonlinear complementarity problems, A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems, Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems., Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems, \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A new continuation method for complementarity problems with uniform P- functions
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A class of linear complementarity problems solvable in polynomial time
- 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 \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
- An interior point potential reduction algorithm for the linear complementarity problem
- Interior-point methods for convex programming
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- Global convergence in infeasible-interior-point algorithms
- Interior-point methods for nonlinear complementarity problems
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- A path following algorithm for a class of convex programming problems
- Path-Following Methods for Linear Programming
- A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
- Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
- A Positive Algorithm for the Nonlinear Complementarity Problem
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
- Generalized Linear Complementarity Problems
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- Large-Step Interior Point Algorithms for Linear Complementarity Problems
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
