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

(39)

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

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)