Approximation algorithms for indefinite complex quadratic maximization problems
From MaRDI portal
Publication:625875
DOI10.1007/s11425-010-3087-7zbMath1209.90284MaRDI QIDQ625875
Yong-Wei Huang, Shu-Zhong Zhang
Publication date: 25 February 2011
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-010-3087-7
randomized algorithms; approximation ratio; semidefinite programming relaxation; indefinite Hermitian matrix
Related Items
An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels, A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis, Approximation algorithms for discrete polynomial optimization, Approximation algorithms for optimization of real-valued general conjugate complex forms, Approximation methods for complex polynomial optimization, Partially positive matrices, An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance, On decompositions and approximations of conjugate partial-symmetric tensors
Uses Software
Cites Work
- Unnamed Item
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- A new upper bound for the complex Grothendieck constant
- A proof of the Grothendieck inequality
- Constantes de Grothendieck et fonctions de type positif sur les sphères
- Approximating quadratic programming with bound and quadratic constraints
- Quadratic maximization and semidefinite relaxation
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Linear and graphical models for the multivariate complex normal distribution
- On maximization of quadratic form over intersection of ellipsoids with common center
- On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
- Convex quadratic and semidefinite programming relaxations in scheduling
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Complex Quadratic Optimization and Semidefinite Programming
- Approximating the Cut-Norm via Grothendieck's Inequality
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
