An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones
From MaRDI portal
Publication:5851658
DOI10.1063/1.3241352zbMath1183.90424OpenAlexW1659710326MaRDI QIDQ5851658
Publication date: 22 January 2010
Published in: AIP Conference Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.3241352
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (8)
A path following interior-point method for linear complementarity problems over circular cones ⋮ A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming ⋮ A new infeasible-interior-point algorithm for linear programming over symmetric cones ⋮ Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones ⋮ A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function ⋮ A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming ⋮ Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects ⋮ Unnamed Item
This page was built for publication: An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones
