An arc-search predictor-corrector infeasible-interior-point algorithm for P_()-SCLCPs

DOI10.1007/S11075-019-00736-4MaRDI QIDQ2173343zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 22 April 2020

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-019-00736-4

zbMATH Keywords

arc-search directionsEuclidean Jordan algebrainfeasible-interior-point algorithmsymmetric conewide neighborhood

Mathematics Subject Classification ID

Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Cites work

• 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 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 unified approach to interior point algorithms for linear complementarity problems: A summary
• A wide neighborhood infeasible-interior-point method with arc-search for \(P_\ast (\kappa)\)-SCLCPs
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
• Extension of primal-dual interior point algorithms to symmetric cones
• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian P_()-LCP over symmetric cones
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Neighborhood-following algorithms for linear programming
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
• Two wide neighborhood interior-point methods for symmetric cone optimization

Cited in

(1)

• A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming

This page was built for publication: An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs

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