An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs
From MaRDI portal
Publication:2173343
DOI10.1007/s11075-019-00736-4OpenAlexW2947328213MaRDI QIDQ2173343
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
symmetric coneEuclidean Jordan algebrawide neighborhoodinfeasible-interior-point algorithmarc-search directions
Related Items (1)
Cites Work
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- Neighborhood-following algorithms for linear programming
- Two wide neighborhood interior-point methods for symmetric cone optimization
- A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs
- Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones
- Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
This page was built for publication: An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs
