A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity
DOI10.1080/02331934.2016.1231187zbMath1383.90040OpenAlexW2524253346MaRDI QIDQ2836103
No author found.
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
linear complementarity problemwide neighborhoodinfeasible-interior-point methodsymmetric cone programming\(P_\ast(\kappa)\)-property
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (1)
Cites Work
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new polynomial-time algorithm for linear programming
- A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- 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
- Extension of primal-dual interior point algorithms to symmetric cones
- Neighborhood-following algorithms for linear programming
- A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 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
- Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- 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: A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity
