Quadratic convex reformulations for a class of complex quadratic programming problems
From MaRDI portal
Cites work
- A new technique to derive tight convex underestimators (sometimes envelopes)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A unified framework for tree search decoding: rediscovering the sequential decoder
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
- Complex Quadratic Optimization and Semidefinite Programming
- Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
- Designing Unimodular Codes Via Quadratic Optimization
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Extending the QCR method to general mixed-integer programs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Probabilistic analysis of the semidefinite relaxation detector in digital communications
- Quadratic convex reformulations for quadratic 0-1 programming
- Quadratic convex reformulations for semicontinuous quadratic programming
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
This page was built for publication: Quadratic convex reformulations for a class of complex quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7005452)
