On approximating complex quadratic optimization problems via semidefinite programming relaxations
From MaRDI portal
Publication:877200
DOI10.1007/S10107-006-0064-6zbMATH Open1192.90134OpenAlexW4236826464MaRDI QIDQ877200FDOQ877200
Authors: Anthony Man-Cho So, Yinyu Ye, Jiawei 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
Recommendations
- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
- Complex Quadratic Optimization and Semidefinite Programming
- Quadratic maximization and semidefinite relaxation
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
complex semidefinite programmingGrothendieck's inequalitycomplex quadratic programmingHermitian quadratic functions
Cites Work
- Semidefinite Programming
- Approximation algorithms for NP-hard problems.
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Title not available (Why is that?)
- On maximization of quadratic form over intersection of ellipsoids with common center
- Approximating the cut-norm via Grothendieck's inequality
- Quadratic forms on graphs (extended abstract)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Complex Quadratic Optimization and Semidefinite Programming
- Approximating quadratic programming with bound and quadratic constraints
- On the complexity of purely complex μ computation and related problems in multidimensional systems
- A proof of the Grothendieck inequality
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
Cited In (29)
- Approximation algorithms for indefinite complex quadratic maximization problems
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- 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
- Approximation methods for complex polynomial optimization
- Title not available (Why is that?)
- On recovery guarantees for angular synchronization
- Title not available (Why is that?)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- On decompositions and approximations of conjugate partial-symmetric tensors
- Computation of the phase and gain margins of MIMO control systems
- New semidefinite relaxations for a class of complex quadratic programming problems
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
- Quadratic maximization and semidefinite relaxation
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
- Frequency-hopping code design for Target detection via optimization theory
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
- Moment inequalities for sums of random matrices and their applications in optimization
- Complex Quadratic Optimization and Semidefinite Programming
- A unified approach to synchronization problems over subgroups of the orthogonal group
- The Grothendieck inequality revisited
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Phase recovery, MaxCut and complex semidefinite programming
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Disentangling orthogonal matrices
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
This page was built for publication: On approximating complex quadratic optimization problems via semidefinite programming relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877200)
