An efficient algorithm for convex quadratic semi-definite optimization

DOI10.3934/NACO.2012.2.129zbMATH Open1246.65096OpenAlexW2317574856MaRDI QIDQ449548FDOQ449548

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

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

zbMATH Keywords

complexity analysisinterior point algorithmconvex quadratic semi-definite optimization

Mathematics Subject Classification ID

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

Cited In (15)

• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions
• Title not available (Why is that?)
• An O(n) algorithm for least squares quasi-convex approximation
• An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
• Title not available (Why is that?)
• An Algorithm for Unconstrained Quadratically Penalized Convex Optimization
• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
• Algorithm for cardinality-constrained quadratic optimization
• 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
• A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
• Solving a class of inverse semidefinite quadratic programming problem

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)