Quadratic Matrix Programming

DOI10.1137/05064816XzbMath1136.90025MaRDI QIDQ5426905

Amir Beck

Publication date: 16 November 2007

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/05064816x

zbMATH Keywords

strong duality; semidefinite relaxation; nonconvex quadratic problems; quadratic matrix programming

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C20: Quadratic programming

90C46: Optimality conditions and duality in mathematical programming

Related Items

On the Hermitian structures of the solution to a pair of matrix equations, Unnamed Item, Solutions of a second-order conjugate matrix equation, On Convex Hulls of Epigraphs of QCQPs, On Integrality in Semidefinite Programming for Discrete Optimization, Linear Programming on the Stiefel Manifold, Formulas for calculating the extremum ranks and inertias of a four-term quadratic matrix-valued function and their applications, A new semidefinite programming relaxation scheme for a class of quadratic matrix problems, The generalized trust region subproblem, Smooth strongly convex interpolation and exact worst-case performance of first-order methods, New results on Hermitian matrix rank-one decomposition, Semidefinite approximations for quadratic programs over orthogonal matrices, A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs, Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method, On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls, A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid, Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming, On the tightness of SDP relaxations of QCQPs, A survey of hidden convex optimization, Efficient first-order methods for convex minimization: a constructive approach, Performance of first-order methods for smooth convex minimization: a novel approach, Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem