A primal-dual predictor-corrector interior-point method for symmetric cone programming with O (r ^-1) iteration complexity
From MaRDI portal
Publication:3174878
DOI10.1080/00207160.2016.1274742zbMATH Open1391.90409OpenAlexW2567093390MaRDI QIDQ3174878FDOQ3174878
Author name not available (Why is that?)
Publication date: 18 July 2018
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2016.1274742
Recommendations
- A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
- 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 neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
interior-point methodspredictor-corrector algorithmEuclidean Jordan algebrasymmetric conewide neighbourhood
Cites Work
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Title not available (Why is that?)
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- 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
- On Mehrotra-Type Predictor-Corrector Algorithms
- A Jordan-algebraic approach to potential-reduction algorithms
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Neighborhood-following algorithms for linear programming
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- 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
- 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
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- 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
- An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
Cited In (4)
- A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming
- An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones
This page was built for publication: A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174878)
