A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones

DOI10.1142/S179355711650039XzbMath1336.90058OpenAlexW2226335522MaRDI QIDQ2805950

Mohammad Pirhaji, Maryam Zangiabadi, Hossein Mansouri

Publication date: 13 May 2016

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179355711650039x

zbMATH Keywords

Euclidean Jordan algebrasinterior point methodspolynomial complexityhorizontal linear complementarity problem

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items

A wide neighborhood arc-search interior-point algorithm for convex quadratic programming

Cites Work

• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
• A modified infeasible-interior-point algorithm for linear optimization problems
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• Function spaces and reproducing kernels on bounded symmetric domains
• A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over symmetric cones
• On theP_*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
• Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP