Complex Matrix Decomposition and Quadratic Programming

DOI10.1287/MOOR.1070.0268MaRDI QIDQ5388059zbMATH OpenOpenAlexFDO

Authors Yong-Wei Huang, Shuzhong 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

complex co-positivity conematrix rank-one decompositionquadratic optimizations-procedure

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Quadratic programming (90C20)

Recommendations

• On Cones of Nonnegative Quadratic Functions
• New results on Hermitian matrix rank-one decomposition
• Quadratic Matrix Programming
• Semidefinite programming, matrix decomposition, and radar code design
• Approximating non-convex quadratic programs by semidefinite and copositive programming

Cited in

(15)

• 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
• Systems of Hermitian Quadratic Forms
• New results on Hermitian matrix rank-one decomposition
• An optimality gap test for a semidefinite relaxation of a quadratic program with two quadratic constraints
• Quaternion matrix decomposition and its theoretical implications
• Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
• Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints
• On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints

This page was built for publication: Complex Matrix Decomposition and Quadratic Programming

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