Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
From MaRDI portal
Recommendations
- Complexity of a Mehrotra-type predictor-corrector algorithm for monotone nonlinear complementarity problems
- Two interior-point methods for nonlinear P_*()-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
Cites work
- A class of linear complementarity problems solvable in polynomial time
- A path following algorithm for a class of convex programming problems
- A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
- Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- Interior-point methods for nonlinear complementarity problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- 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
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
Cited in
(8)- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- Predictor-corrector method for nonlinear complementarity problems
- Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
- Two interior-point methods for nonlinear P_*()-complementarity problems.
- Interior-point methods for nonlinear complementarity problems
- Iteration complexity of generalized complementarity problems
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- Complexity of a Mehrotra-type predictor-corrector algorithm for monotone nonlinear 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)
