A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
From MaRDI portal
(Redirected from Publication:5058407)
Recommendations
- A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
Cites work
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
- 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 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 predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs
- Barrier Functions in Interior Point Methods
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Neighborhood-following algorithms for linear programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Two wide neighborhood interior-point methods for symmetric cone optimization
Cited in
(13)- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- Two wide neighborhood interior-point methods for symmetric cone optimization
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
- A wide neighborhood predictor-corrector infeasible-interior-point method for Cartesian P_* ()-LCP over symmetric cones
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
- scientific article; zbMATH DE number 5606390 (Why is no real title available?)
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
This page was built for publication: A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058407)
