Two wide neighborhood interior-point methods for symmetric cone optimization
From MaRDI portal
Publication:2401022
DOI10.1007/S10589-017-9905-XzbMATH Open1370.90141OpenAlexW2593994861MaRDI QIDQ2401022FDOQ2401022
Authors: Yanyan Li 
Publication date: 31 August 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9905-x
Recommendations
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- An interior-point method for symmetric optimization based on a new wide neighborhood
- 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 interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
- A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
- A new corrector-predictor interior-point method for symmetric cone optimization
- Neighborhood-following algorithms for symmetric cone programming
- A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones
- A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- An Interior-Point Method for Semidefinite Programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- 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
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- Title not available (Why is that?)
- A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
- 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{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
- 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
- On the Nesterov--Todd Direction in Semidefinite Programming
- Barrier Functions in Interior Point Methods
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- Curvature integrals and iteration complexities in SDP and symmetric cone programs
- 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
- A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
Cited In (12)
- An \(\operatorname{O}(\sqrt{r}(\operatorname{cond}(G))^{1 / 4}\log \varepsilon^{- 1})\) iteration predictor-corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization
- A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
- An interior-point method for symmetric optimization based on a new wide neighborhood
- 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
- Extension of primal-dual interior point algorithms to symmetric cones
- Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity
- An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
- Neighborhood-following algorithms for symmetric cone programming
- A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions
Uses Software
This page was built for publication: Two wide neighborhood interior-point methods for symmetric cone optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401022)
