Complex Quadratic Optimization and Semidefinite Programming

Recommendations

On approximating complex quadratic optimization problems via semidefinite programming relaxations
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming

Cited in

(40)

Quadratic maximization and semidefinite relaxation
On the complex fractional quadratic optimization with a quadratic constraint
Radar waveform design for extended target recognition under detection constraints
A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
Penalized semidefinite programming for quadratically-constrained quadratic optimization
Hermitian completely positive matrices
On decompositions and approximations of conjugate partial-symmetric tensors
Frequency-hopping code design for Target detection via optimization theory
Phase recovery, MaxCut and complex semidefinite programming
On recovery guarantees for angular synchronization
Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
Computational methods for solving nonconvex block-separable constrained quadratic problems
Nonconvex phase synchronization
On quadratic programming with a ratio objective
An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations
scientific article; zbMATH DE number 4068621 (Why is no real title available?)
Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
Near-optimal bounds for phase synchronization
scientific article; zbMATH DE number 7626745 (Why is no real title available?)
Quadratic Combinatorial Optimization Using Separable Underestimators
Complex semidefinite programming and Max-\(k\)-Cut
Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
Inhomogeneous polynomial optimization over a convex set: an approximation approach
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
New semidefinite relaxations for a class of complex quadratic programming problems
A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem
Approximation algorithms for indefinite complex quadratic maximization problems
Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
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
A second-order cone relaxation-based branch-and-bound algorithm for complex quadratic programs on acyclic graphs
Random multitype spanning forests for synchronization on sparse graphs
Dynamic angular synchronization under smoothness constraints
Quadratic convex reformulations for a class of complex quadratic programming problems
Cuts and semidefinite liftings for the complex cut polytope
Approximation methods for complex polynomial optimization
On approximating complex quadratic optimization problems via semidefinite programming relaxations
On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls

This page was built for publication: Complex Quadratic Optimization and Semidefinite Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470223)