On approximating complex quadratic optimization problems via semidefinite programming relaxations
From MaRDI portal
(Redirected from Publication:877200)
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
Cites work
- scientific article; zbMATH DE number 1534298 (Why is no real title available?)
- A proof of the Grothendieck inequality
- Approximating quadratic programming with bound and quadratic constraints
- Approximating the cut-norm via Grothendieck's inequality
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Approximation algorithms for NP-hard problems.
- Complex Quadratic Optimization and Semidefinite Programming
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On maximization of quadratic form over intersection of ellipsoids with common center
- On the complexity of purely complex μ computation and related problems in multidimensional systems
- Quadratic forms on graphs (extended abstract)
- Semidefinite Programming
Cited in
(32)- Approximation algorithms for indefinite complex quadratic maximization problems
- On the estimation performance and convergence rate of the generalized power method for phase synchronization
- 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
- On quadratic programming with a ratio objective
- Approximation methods for complex polynomial optimization
- scientific article; zbMATH DE number 1833395 (Why is no real title available?)
- On recovery guarantees for angular synchronization
- scientific article; zbMATH DE number 1751736 (Why is no real title available?)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- Quadratic convex reformulations for a class of complex quadratic programming problems
- On decompositions and approximations of conjugate partial-symmetric tensors
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- Computation of the phase and gain margins of MIMO control systems
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- New semidefinite relaxations for a class of complex quadratic programming problems
- 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
- 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
- The Grothendieck inequality revisited
- A unified approach to synchronization problems over subgroups of the orthogonal group
- 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)
