A polynomial path-following interior point algorithm for general linear complementarity problems
From MaRDI portal
Publication:989885
DOI10.1007/s10898-008-9348-0zbMath1200.90163OpenAlexW2167785353MaRDI QIDQ989885
Tibor Illés, Tamás Terlaky, Marianna Nagy
Publication date: 23 August 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9348-0
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (22)
An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood ⋮ Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier ⋮ Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation ⋮ A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems ⋮ Sufficient weighted complementarity problems ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game ⋮ An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity ⋮ Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ A corrector-predictor interior-point method with new search direction for linear optimization ⋮ 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 ⋮ The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems ⋮ A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ Unnamed Item ⋮ A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ 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
- Unnamed Item
- Determining the handicap of a sufficient matrix
- EP theorem for dual linear complementarity problems
- Sufficient matrices and the linear complementarity problem
- A polynomial-time algorithm for a class of linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- EP theorems and linear complementarity problems
- The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
- On a subclass of \(P_ 0\)
- \(P_ *\)-matrices are just sufficient
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
This page was built for publication: A polynomial path-following interior point algorithm for general linear complementarity problems
