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 barrierA modified damped Gauss–Newton method for non-monotone weighted linear complementarity problemsComplexity analysis of a full-{N}ewton step interior-point method for linear optimizationAn infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric conesThe s-monotone index selection rule for criss-cross algorithms of linear complementarity problemsA primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directionsA polynomial path-following interior point algorithm for general linear complementarity problemsPolynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central pathNew method for determining search directions for interior-point algorithms in linear optimizationLarge-step interior-point algorithm for linear optimization based on a new wide neighbourhoodA new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel functionFeasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search DirectionPredictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique



Cites Work