An efficient algorithm for convex quadratic semi-definite optimization

DOI10.3934/NACO.2012.2.129MaRDI QIDQ449548zbMATH OpenOpenAlexFDO

Authors Lipu Zhang, Yinghong Xu, Zhengjing Jin

Publication date 30 August 2012

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

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

zbMATH Keywords

complexity analysisinterior point algorithmconvex quadratic semi-definite optimization

Mathematics Subject Classification ID

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

Recommendations

• A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
• A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
• A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function

Cited in

(15)

• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
• A robust algorithm for quadratic optimization under quadratic constraints
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
• Solving a class of inverse semidefinite quadratic programming problem
• Algorithm for cardinality-constrained quadratic optimization
• An O(n) algorithm for least squares quasi-convex approximation
• A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions
• An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
• scientific article; zbMATH DE number 3928729 (Why is no real title available?)
• An Algorithm for Unconstrained Quadratically Penalized Convex Optimization
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• scientific article; zbMATH DE number 5263160 (Why is no real title available?)
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
• A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs

This page was built for publication: An efficient algorithm for convex quadratic semi-definite optimization

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