Kernel-function Based Algorithms for Semidefinite Optimization

DOI10.1051/ro/2009011zbMath1170.90455MaRDI QIDQ3632808

Cornelis Roos, Yan-Qin Bai, M. El Ghami

Publication date: 12 June 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105428

zbMATH Keywords

complexity; primal-dual method; interior-point methods

Mathematics Subject Classification ID

90C22: Semidefinite programming

90C31: Sensitivity, stability, parametric optimization

Related Items

A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, Kernel-function Based Primal-Dual Algorithms forP_*(κ) Linear Complementarity Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function
• Matrix Analysis
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization