Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones
From MaRDI portal
Publication:5248204
DOI10.1080/02331934.2013.820300zbMath1312.49034OpenAlexW2063581972MaRDI QIDQ5248204
Xinze Liu, Hong-Wei Liu, Wei-wei Wang
Publication date: 28 April 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.820300
linear complementarity probleminterior-point methodspolynomial complexitysymmetric conesEuclidean Jordan algebraMehrotra-type predictor-corrector algorithm
Convex programming (90C25) Newton-type methods (49M15) Linear programming (90C05) Interior-point methods (90C51)
Related Items
A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP ⋮ An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs ⋮ A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones ⋮ A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs ⋮ On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems ⋮ A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity
Cites Work
- A damped Gauss-Newton method for the second-order cone complementarity problem
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- A unified approach to interior point algorithms for linear complementary problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
This page was built for publication: Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones
