On approximating complex quadratic optimization problems via semidefinite programming relaxations

DOI10.1007/s10107-006-0064-6zbMath1192.90134OpenAlexW4236826464MaRDI QIDQ877200

Yinyu Ye, Anthony Man-Cho So, Jia-Wei Zhang

Publication date: 19 April 2007

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-006-0064-6

zbMATH Keywords

complex semidefinite programmingGrothendieck's inequalitycomplex quadratic programmingHermitian quadratic functions

Mathematics Subject Classification ID

Semidefinite programming (90C22) Integer programming (90C10) Quadratic programming (90C20)

Related Items

Approximating the little Grothendieck problem over the orthogonal and unitary groups, On recovery guarantees for angular synchronization, Computation of the phase and gain margins of MIMO control systems, A unified approach to synchronization problems over subgroups of the orthogonal group, Approximation algorithms for indefinite complex quadratic maximization problems, New semidefinite relaxations for a class of complex quadratic programming problems, On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization, Moment inequalities for sums of random matrices and their applications in optimization, Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection, On decompositions and approximations of conjugate partial-symmetric tensors, Approximation algorithms for optimization of real-valued general conjugate complex forms, Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming, Disentangling orthogonal matrices, Tightness of the maximum likelihood semidefinite relaxation for angular synchronization, Frequency-hopping code design for Target detection via optimization theory, Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations, Phase recovery, MaxCut and complex semidefinite programming, Approximation methods for complex polynomial optimization, The Grothendieck Inequality Revisited, Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting, Hardness and Approximation Results for L_p-Ball Constrained Homogeneous Polynomial Optimization Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• A proof of the Grothendieck inequality
• Approximating quadratic programming with bound and quadratic constraints
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
• On maximization of quadratic form over intersection of ellipsoids with common center
• Approximating the cut-norm via Grothendieck's inequality
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• On the complexity of purely complex μ computation and related problems in multidimensional systems
• Semidefinite Programming
• Complex Quadratic Optimization and Semidefinite Programming
• Extended Matrix Cube Theorems with Applications to μ-Theory in Control
• Quadratic forms on graphs