Approximation algorithms for indefinite complex quadratic maximization problems
From MaRDI portal
Publication:625875
Recommendations
- Complex Quadratic Optimization and Semidefinite Programming
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Approximation algorithms for indefinite quadratic programming
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Approximation methods for complex polynomial optimization
Cites work
- A new upper bound for the complex Grothendieck constant
- 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 Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Complex Quadratic Optimization and Semidefinite Programming
- Constantes de Grothendieck et fonctions de type positif sur les sphères
- Convex quadratic and semidefinite programming relaxations in scheduling
- Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
- scientific article; zbMATH DE number 1302192 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Linear and graphical models for the multivariate complex normal distribution
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- On maximization of quadratic form over intersection of ellipsoids with common center
- On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty
- Quadratic maximization and semidefinite relaxation
- Semidefinite relaxation and nonconvex quadratic optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(10)- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- On decompositions and approximations of conjugate partial-symmetric tensors
- Approximation algorithms for discrete polynomial optimization
- 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 optimization of real-valued general conjugate complex forms
- On approximation algorithms for commutative quaternion polynomial optimization
- Convergence of the sum-of-squares hierarchy for quadratic optimization over roots-of-unity
- Approximation methods for complex polynomial optimization
- Partially positive matrices
This page was built for publication: Approximation algorithms for indefinite complex quadratic maximization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625875)
