Complex Matrix Decomposition and Quadratic Programming

DOI10.1287/moor.1070.0268zbMath1341.90096MaRDI QIDQ5388059

Yong-Wei Huang, Shu-Zhong Zhang

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1070.0268

zbMATH Keywords

quadratic optimization; matrix rank-one decomposition; complex co-positivity cone; s-procedure

Mathematics Subject Classification ID

90C20: Quadratic programming

15B48: Positive matrices and their generalizations; cones of matrices

Related Items

An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints, Quaternion matrix decomposition and its theoretical implications, New results on Hermitian matrix rank-one decomposition, Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, On the complex fractional quadratic optimization with a quadratic constraint, Theorems of the alternative for inequality systems of real polynomials, On fractional quadratic optimization problem with two quadratic constraints, Beamforming optimization for information enhancement transmission in MISO SWIPT with NOMA system, A general method for solving linear matrix equations of elliptic biquaternions with applications, Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting, Computation of the phase and gain margins of MIMO control systems