Two wide neighborhood interior-point methods for symmetric cone optimization
From MaRDI portal
Publication:2401022
DOI10.1007/s10589-017-9905-xzbMath1370.90141OpenAlexW2593994861MaRDI QIDQ2401022
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
Related Items (4)
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 wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming ⋮ An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs ⋮ Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Curvature integrals and iteration complexities in SDP and symmetric cone programs
- 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
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- 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
- 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
- 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
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- Neighborhood-following algorithms for linear programming
- A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone 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
- On the Nesterov--Todd Direction in Semidefinite Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- An Interior-Point Method for Semidefinite Programming
- 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: Two wide neighborhood interior-point methods for symmetric cone optimization
