Pages that link to "Item:Q877200"
From MaRDI portal
The following pages link to On approximating complex quadratic optimization problems via semidefinite programming relaxations (Q877200):
Displaying 26 items.
- Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957) (← links)
- Disentangling orthogonal matrices (Q526289) (← links)
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← links)
- Approximation algorithms for indefinite complex quadratic maximization problems (Q625875) (← links)
- Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
- Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
- Approximation methods for complex polynomial optimization (Q742305) (← links)
- Quadratic maximization and semidefinite relaxation (Q1575069) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- On decompositions and approximations of conjugate partial-symmetric tensors (Q2240646) (← links)
- Frequency-hopping code design for Target detection via optimization theory (Q2275335) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
- Phase recovery, MaxCut and complex semidefinite programming (Q2515033) (← links)
- On recovery guarantees for angular synchronization (Q2663272) (← links)
- Computation of the phase and gain margins of MIMO control systems (Q2681387) (← links)
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations (Q2797107) (← links)
- The Grothendieck inequality revisited (Q2925657) (← links)
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations (Q3586136) (← links)
- On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization (Q4602339) (← links)
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection (Q4629340) (← links)
- Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)
- A unified approach to synchronization problems over subgroups of the orthogonal group (Q6117023) (← links)
- New semidefinite relaxations for a class of complex quadratic programming problems (Q6166105) (← links)
