Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
From MaRDI portal
Publication:1366422
DOI10.1007/BF02614359zbMATH Open0889.90138OpenAlexW1982718164MaRDI QIDQ1366422FDOQ1366422
Authors: Benjamin Jansen, Kees Roos, Tamás Terlaky, Akiko Yoshise 
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
Recommendations
- Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
- Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
- scientific article; zbMATH DE number 1086734
Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Title not available (Why is that?)
- Large-Step Interior Point Algorithms for Linear Complementarity Problems
- On some efficient interior point methods for nonlinear convex programming
- Title not available (Why is that?)
- 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
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- A polynomial-time algorithm for a class of linear complementarity problems
- Generalized Linear Complementarity Problems
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- Interior path following primal-dual algorithms. I: Linear programming
- Path-Following Methods for Linear Programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
- Title not available (Why is that?)
- Interior-point methods for nonlinear complementarity problems
- A class of linear complementarity problems solvable in polynomial time
- Title not available (Why is that?)
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- A new continuation method for complementarity problems with uniform P- functions
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
- An interior point potential reduction algorithm for the linear complementarity problem
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- Global convergence in infeasible-interior-point algorithms
- Interior-point methods for convex programming
- Title not available (Why is that?)
- A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
- A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
- A Positive Algorithm for the Nonlinear Complementarity Problem
- Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
Cited In (9)
- Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
- Interior point algorithm for \(P_*\) nonlinear complementarity problems
- \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems
- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
- Title not available (Why is that?)
- Primal-dual affine-scaling algorithms fail for semidefinite programming
This page was built for publication: Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366422)
