Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity

DOI10.1137/120884341zbMath1291.90314OpenAlexW2017573175MaRDI QIDQ4979856

Florian A. Potra

Publication date: 19 June 2014

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/740a8adec6f1a85a512f1744ff77660eb1c635e0

zbMATH Keywords

linear complementaritypath followinginterior pointwide neighborhoodsufficient matrixcorrector-predictor

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (25)

Sufficient weighted complementarity problems ⋮ An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization ⋮ A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming ⋮ A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization ⋮ An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path ⋮ A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming ⋮ A step-truncated method in a wide neighborhood interior-point algorithm for linear programming ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions ⋮ A corrector-predictor interior-point method with new search direction for linear optimization ⋮ A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood ⋮ A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization ⋮ New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP ⋮ An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization ⋮ A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood ⋮ A wide neighborhood interior-point algorithm based on the trigonometric kernel function ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood ⋮ A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization ⋮ A new second-order corrector interior-point algorithm for P*(k)-LCP

This page was built for publication: Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity