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
From MaRDI portal
Publication:3083311
DOI10.1137/080729311zbMath1228.90072OpenAlexW2035277428MaRDI QIDQ3083311
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080729311
Related Items (45)
An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood ⋮ Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier ⋮ 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 new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming ⋮ A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood ⋮ A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity ⋮ A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization ⋮ Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions ⋮ A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization ⋮ A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming ⋮ A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming ⋮ An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems ⋮ Two wide neighborhood interior-point methods for symmetric cone optimization ⋮ A new infeasible-interior-point algorithm for linear programming over symmetric cones ⋮ A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization ⋮ 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 new second-order corrector interior-point algorithm for semidefinite programming ⋮ A step-truncated method in a wide neighborhood interior-point algorithm for linear programming ⋮ A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions ⋮ On the extension of an arc-search interior-point algorithm for semidefinite optimization ⋮ A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization ⋮ A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood ⋮ Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization ⋮ A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP ⋮ An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization ⋮ A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function ⋮ An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming ⋮ A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions ⋮ A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ Self-Regular Interior-Point Methods for Semidefinite Optimization ⋮ An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones ⋮ A wide neighborhood interior-point algorithm based on the trigonometric kernel function ⋮ A wide neighborhood predictor–corrector infeasible-interior-point method for Cartesian P∗(κ)-LCP over symmetric cones ⋮ A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity ⋮ A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization ⋮ New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming
This page was built for publication: 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
