EP theorem for dual linear complementarity problems
From MaRDI portal
Publication:1016385
DOI10.1007/s10957-008-9440-0zbMath1163.90032OpenAlexW2018846914MaRDI QIDQ1016385
Tamás Terlaky, Marianna Nagy, Tibor Illés
Publication date: 5 May 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9440-0
Related Items
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier ⋮ A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ 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 ⋮ A polynomial path-following interior point algorithm for general linear complementarity problems ⋮ 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 ⋮ 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
- Sufficient matrices and the linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- EP theorems and linear complementarity problems
- On a subclass of \(P_ 0\)
- \(P_ *\)-matrices are just sufficient
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices