On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization
From MaRDI portal
Publication:3562415
DOI10.1080/10556780802571392zbMath1220.90082OpenAlexW2013989683MaRDI QIDQ3562415
Publication date: 21 May 2010
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780802571392
Related Items (10)
Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier ⋮ A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming ⋮ A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization ⋮ Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming ⋮ A new second-order Mehrotra-type predictor-corrector algorithm for SDO ⋮ Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones ⋮ A primal-dual interior-point algorithm with arc-search for semidefinite programming ⋮ New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming
Uses Software
This page was built for publication: On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization
