A polynomial interior-point algorithm for monotone linear complementarity problems
From MaRDI portal
Publication:353166
DOI10.1007/s10957-012-0195-2zbMath1267.90155OpenAlexW1980977181MaRDI QIDQ353166
Publication date: 12 July 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0195-2
polynomial complexitycentral pathfeasible interior-point methodmonotone linear complementarity problem (MLCP)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (16)
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ A path following interior-point method for linear complementarity problems over circular cones ⋮ An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function ⋮ New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP ⋮ A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions ⋮ A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ An adaptive infeasible interior-point algorithm for linear complementarity problems ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ Unnamed Item ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Corrector-predictor methods for sufficient linear complementarity problems
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A new polynomial-time algorithm for linear programming
- Test examples for nonlinear programming codes
- A unified approach to interior point algorithms for linear complementary problems
- Self-regular functions and new search directions for linear and semidefinite optimization
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- Improved infeasible-interior-point algorithm for linear complementarity problerns
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
This page was built for publication: A polynomial interior-point algorithm for monotone linear complementarity problems
