A class of polynomial primal-dual interior-point algorithms for semidefinite optimization

DOI10.1007/S11741-006-0114-6MaRDI QIDQ3415567zbMATH OpenOpenAlexFDO

Authors Guoqiang Wang, Yanqin Bai

Publication date 19 January 2007

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

Full work available at URL https://doi.org/10.1007/s11741-006-0114-6

zbMATH Keywords

large- and small-update methodspolynomial complexityprimal-dual interior-point methodssemidefinite optimization (SDO)

Mathematics Subject Classification ID

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

Recommendations

• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• A new primal-dual interior-point algorithm for semidefinite optimization
• A new primal-dual interior-point algorithm for solving semidefinite optimization
• A primal-dual interior point method for nonlinear semidefinite programming
• On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence
• A primal-dual interior point method for parametric semidefinite programming problems
• A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
• A primal-dual regularized interior-point method for semidefinite programming
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming

Cites work

• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1047679 (Why is no real title available?)
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming

Cited in

(12)

• Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
• An efficient parameterized logarithmic kernel function for semidefinite optimization
• Reduction of truss topology optimization
• A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions
• A penalized interior point approach for constrained nonlinear programming
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems
• A new primal-dual interior-point algorithm for convex quadratic optimization
• Primal-dual interior point algorithms for semidefinite optimization based on a kernel function with quadratic growth rate
• Large-update primal-dual interior-point algorithm for semidefinite optimization

This page was built for publication: A class of polynomial primal-dual interior-point algorithms for semidefinite optimization

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