A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions

DOI10.1080/10556780903239048MaRDI QIDQ3562408zbMATH OpenOpenAlexFDO

Authors M. El Ghami, C. Roos, Trond Steihaug

Publication date 21 May 2010

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780903239048

zbMATH Keywords

interior-pointkernel functionprimal-dual methodsemidefinite optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31) Interior-point methods (90C51)

Recommendations

• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
• Kernel function based interior-point algorithms for semidefinite optimization
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• A new primal-dual interior-point algorithm for semidefinite optimization

Cited in

(18)

• A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
• New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP
• Large-update interior point algorithm for P_*-linear complementarity problem
• Self-regular interior-point methods for semidefinite optimization
• A path following interior-point algorithm for semidefinite optimization problem based on new kernel function
• On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
• A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
• AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
• scientific article; zbMATH DE number 6515403 (Why is no real title available?)
• Kernel-function Based Algorithms for Semidefinite Optimization
• 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
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term

This page was built for publication: A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562408)