A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
From MaRDI portal
Publication:2709447
DOI10.1080/02331930008844515zbMath1052.90101OpenAlexW2039096676MaRDI QIDQ2709447
Publication date: 27 November 2001
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930008844515
Abstract computational complexity for mathematical programming problems (90C60) Numerical methods based on nonlinear programming (49M37) Interior-point methods (90C51)
Related Items
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications, A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones, 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.
Cites Work
- Unnamed Item
- Convergence behavior of interior-point algorithms
- On Q-order and R-order of convergence
- A new continuation method for complementarity problems with uniform P- functions
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- Interior-point methods for nonlinear complementarity problems
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- A path following algorithm for a class of convex programming problems
- A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- A Primal-dual affine scaling algorithm with necessary centering as a safeguard
- Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
- Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
- Large-Step Interior Point Algorithms for Linear Complementarity Problems
