Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
From MaRDI portal
Recommendations
- Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
- Two interior-point methods for nonlinear P_*()-complementarity problems.
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
- scientific article; zbMATH DE number 1086734
Cites work
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 45207 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A Positive Algorithm for the Nonlinear Complementarity Problem
- A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
- A class of linear complementarity problems solvable in polynomial time
- A new continuation method for complementarity problems with uniform P- functions
- A path following algorithm for a class of convex programming problems
- A polynomial-time algorithm for a class of linear complementarity problems
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
- An interior point potential reduction algorithm for the linear complementarity problem
- Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
- Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Generalized Linear Complementarity Problems
- Global convergence in infeasible-interior-point algorithms
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Interior-point methods for convex programming
- Interior-point methods for nonlinear complementarity problems
- Large-Step Interior Point Algorithms for Linear Complementarity Problems
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- 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
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On some efficient interior point methods for nonlinear convex programming
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- Path-Following Methods for Linear Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
Cited in
(9)- Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
- \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- scientific article; zbMATH DE number 2153272 (Why is no real title available?)
- Primal-dual affine-scaling algorithms fail for semidefinite programming
- A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems
- Interior point algorithm for \(P_*\) nonlinear complementarity problems
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)
