Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term

DOI10.3934/naco.2015.5.101zbMath1317.90187OpenAlexW2525192655MaRDI QIDQ2353462

Zhongtuan Zheng, Zhongchen Wu, Xin-Zhong Cai, Guo-Qiang Wang

Publication date: 14 July 2015

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2015.5.101

zbMATH Keywords

kernel functioninterior-point methodssemidefinite optimizationpolynomial complexitylarge- and small-update methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• An efficient algorithm for convex quadratic semi-definite optimization
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
• Self-regular functions and new search directions for linear and semidefinite optimization
• A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming
• AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
• A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

This page was built for publication: Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term