Complex Matrix Decomposition and Quadratic Programming
From MaRDI portal
Publication:5388059
DOI10.1287/moor.1070.0268zbMath1341.90096OpenAlexW2128757878MaRDI 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
Quadratic programming (90C20) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (12)
A general method for solving linear matrix equations of elliptic biquaternions with applications ⋮ A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables ⋮ On the complex fractional quadratic optimization with a quadratic constraint ⋮ Quaternion matrix decomposition and its theoretical implications ⋮ Computation of the phase and gain margins of MIMO control systems ⋮ Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints ⋮ Theorems of the alternative for inequality systems of real polynomials ⋮ New results on Hermitian matrix rank-one decomposition ⋮ Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting ⋮ On fractional quadratic optimization problem with two quadratic constraints ⋮ Beamforming optimization for information enhancement transmission in MISO SWIPT with NOMA system ⋮ An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints
This page was built for publication: Complex Matrix Decomposition and Quadratic Programming
