A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
From MaRDI portal
Publication:3562408
DOI10.1080/10556780903239048zbMath1220.90081OpenAlexW2009746572MaRDI QIDQ3562408
Cornelis Roos, M. El Ghami, Trond Steihaug
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/10556780903239048
Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31) Interior-point methods (90C51)
Related Items (10)
Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP ⋮ A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function ⋮ Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term ⋮ Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term ⋮ Self-Regular Interior-Point Methods for Semidefinite Optimization ⋮ Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization ⋮ Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term ⋮ Large-update interior point algorithm for \(P_*\)-linear complementarity problem
This page was built for publication: A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
