Complex Quadratic Optimization and Semidefinite Programming
From MaRDI portal
Publication:5470223
DOI10.1137/04061341XzbMath1113.90115MaRDI QIDQ5470223
Yong-Wei Huang, Shu-Zhong Zhang
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/04061341x
randomized algorithms; approximation ratio; Hermitian quadratic functions; complex semidefinite programming relaxation
Related Items
Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection, Near-Optimal Bounds for Phase Synchronization, Unnamed Item, Unnamed Item, Inhomogeneous polynomial optimization over a convex set: An approximation approach, 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, An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding, Tightness of the maximum likelihood semidefinite relaxation for angular synchronization, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, Approximation algorithms for indefinite complex quadratic maximization problems, 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, 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, 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
