A wide neighborhood predictor-corrector infeasible-interior-point method for Cartesian P_* ()-LCP over symmetric cones

DOI10.1142/S1793557116500492MaRDI QIDQ2818293zbMATH OpenOpenAlexFDO

Authors Marzieh Sayadi Shahraki, M. Zangiabadi, H. Mansouri

Publication date 7 September 2016

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

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

zbMATH Keywords

linear complementarity problemwide neighborhoodcentral pathpredictor-corrector infeasible-interior-point method

Mathematics Subject Classification ID

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

Recommendations

• 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
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
• Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones
• A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs
• A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming

Cites work

• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• A homogeneous model for mixed complementarity problems over symmetric cones
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• Function spaces and reproducing kernels on bounded symmetric domains
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones

Cited in

(10)

• Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
• A corrector-predictor interior-point algorithm for \(P_\ast(\kappa)\)-HLCPs over Cartesian product of symmetric cones
• Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones
• Infeasible Mehrotra-type predictor-corrector algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
• scientific article; zbMATH DE number 6847407 (Why is no real title available?)
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs
• 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
• An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP

This page was built for publication: A wide neighborhood predictor-corrector infeasible-interior-point method for Cartesian \(P_* (\kappa)\)-LCP over symmetric cones

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