Approximation algorithms for indefinite complex quadratic maximization problems
From MaRDI portal
Publication:625875
DOI10.1007/S11425-010-3087-7zbMATH Open1209.90284OpenAlexW2070596677MaRDI QIDQ625875FDOQ625875
Authors: Yong-Wei Huang, Shuzhong 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
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
randomized algorithmsapproximation ratiosemidefinite programming relaxationindefinite Hermitian matrix
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Convex quadratic and semidefinite programming relaxations in scheduling
- Approximating the Cut-Norm via Grothendieck's Inequality
- Semidefinite relaxation and nonconvex quadratic optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A new upper bound for the complex Grothendieck constant
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- On maximization of quadratic form over intersection of ellipsoids with common center
- On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- 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
- Title not available (Why is that?)
- Quadratic maximization and semidefinite relaxation
- Linear and graphical models for the multivariate complex normal distribution
- A proof of the Grothendieck inequality
- Constantes de Grothendieck et fonctions de type positif sur les sphères
- Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
Cited In (8)
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Approximation methods for complex polynomial optimization
- On decompositions and approximations of conjugate partial-symmetric tensors
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels
- Partially positive matrices
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
- Approximation algorithms for discrete polynomial optimization
Uses Software
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)
