Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
DOI10.1080/00207169908804783zbMATH Open0918.65047OpenAlexW2110822242MaRDI QIDQ4240625FDOQ4240625
Authors: Zengzhu Xu, Yun-Bin Zhao, Jiye Han 
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
Recommendations
- Complexity of a Mehrotra-type predictor-corrector algorithm for monotone nonlinear complementarity problems
- Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
- Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
- Interior-point methods for nonlinear complementarity problems
- Predictor-corrector method for nonlinear complementarity problems
interior point algorithmscaled Lipschitz conditionnon-monotone nonlinear complementarity problemspolynomial iterative complexity
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Title not available (Why is that?)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A path following algorithm for a class of convex programming problems
- 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
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- Interior-point methods for nonlinear complementarity problems
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
- A class of linear complementarity problems solvable in polynomial time
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
- A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
- A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
Cited In (4)
- Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
- Complexity of a Mehrotra-type predictor-corrector algorithm for monotone nonlinear complementarity problems
- Iteration complexity of generalized complementarity problems
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
This page was built for publication: Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240625)
