A modified infeasible interior-point algorithm for P_()-HLCP over symmetric cones

DOI10.1142/S179355711650039XzbMATH Open1336.90058OpenAlexW2226335522MaRDI QIDQ2805950FDOQ2805950

M. Pirhaji, H. Mansouri, M. Zangiabadi

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

Recommendations

• A new infeasible-interior-point algorithm for linear programming over symmetric cones
• A corrector-predictor interior-point algorithm for \(P_\ast(\kappa)\)-HLCPs over Cartesian product of symmetric cones
• An improved infeasible interior-point method for symmetric cone linear complementarity problem
• Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones
• A long-step interior-point algorithm for symmetric cone Cartesian \(P_\ast (\kappa)\)-HLCP
• An infeasible interior point method for linear complementarity problems over symmetric cones
• An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
• A predictor-corrector infeasible-interior-point method for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones with \(O\left( \sqrt{\mathrm{cond}(G)}(1+\kappa)^2 r\log \varepsilon^{-1} \right)\) iteration complexity
• Infeasible path-following interior point algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming

zbMATH Keywords

interior point methodspolynomial complexityhorizontal linear complementarity problemEuclidean Jordan algebras

Mathematics Subject Classification ID

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

Cites Work

• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
• Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• 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
• 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
• A modified infeasible-interior-point algorithm for linear optimization problems
• On theP_*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones

Cited In (2)

• Title not available (Why is that?)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming

This page was built for publication: A modified infeasible interior-point algorithm for \(P_\ast(\kappa)\)-HLCP over symmetric cones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805950)