Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization

DOI10.1007/s11741-008-0503-2zbMath1174.90737OpenAlexW1505061005MaRDI QIDQ5320239

Zhonggen Qian, Guo-Qiang Wang, Yan-Qin Bai

Publication date: 22 July 2009

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-008-0503-2

zbMATH Keywords

primal-dual methodsemidefinite optimizationpolynomial complexityinterior-point algorithm

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items (7)

Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ 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 ⋮ Interior-point algorithm for linear optimization based on a new trigonometric kernel function ⋮ A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions ⋮ Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems

Cites Work

• Unnamed Item
• Unnamed Item
• Self-regular functions and new search directions for linear and semidefinite optimization
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• On the Nesterov--Todd Direction in Semidefinite Programming
• A primal‐dual interior-point method for linear optimization based on a new proximity function
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization