A predictor-corrector infeasible-interior-point method for the Cartesian P_()-LCP over symmetric cones with O( cond(G)(1+)^2 r ^-1 ) iteration complexity

DOI10.1080/02331934.2016.1231187MaRDI QIDQ2836103zbMATH OpenOpenAlexFDO

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

Publication date 7 December 2016

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2016.1231187

zbMATH Keywords

\(P_\ast(\kappa)\)-propertyinfeasible-interior-point methodlinear complementarity problemsymmetric cone programmingwide neighborhood

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Recommendations

• A wide neighborhood predictor-corrector infeasible-interior-point method for Cartesian P_* ()-LCP over symmetric cones
• Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian P_()-LCP over symmetric cones
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
• A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs

Cites work

• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
• 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 new polynomial-time algorithm for linear programming
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A unified approach to interior point algorithms for linear complementary problems
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• Extension of primal-dual interior point algorithms to symmetric cones
• Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian P_()-LCP over symmetric cones
• Neighborhood-following algorithms for linear programming
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps

Cited in

(13)

• An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
• An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs
• A modified infeasible interior-point algorithm for P_()-HLCP over symmetric cones
• A wide neighborhood predictor-corrector infeasible-interior-point method for Cartesian P_* ()-LCP over symmetric cones
• A corrector-predictor interior-point algorithm for P_()-HLCPs over Cartesian product of symmetric cones
• scientific article; zbMATH DE number 6847407 (Why is no real title available?)
• A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs
• scientific article; zbMATH DE number 1864507 (Why is no real title available?)
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian P_()-LCP over symmetric cones
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones

This page was built for publication: 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

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