Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
From MaRDI portal
Publication:4240625
DOI10.1080/00207169908804783zbMath0918.65047OpenAlexW2110822242MaRDI QIDQ4240625
Zengzhu Xu, Ji-ye Han, Yun-bin Zhao
Publication date: 1 August 1999
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169908804783
interior point algorithmscaled Lipschitz conditionnon-monotone nonlinear complementarity problemspolynomial iterative complexity
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Unnamed Item
- A class of linear complementarity problems solvable in polynomial time
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- 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
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- Interior-point methods for nonlinear complementarity problems
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- 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
- A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
