Blind constant modulus equalization via convex optimization
From MaRDI portal
Cited in
(20)- Blind channel equalization and ε-approximation algorithms
- Approximation methods for complex polynomial optimization
- Blind channel equalization with colored source based on constrained optimization methods
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- A robust unscented transformation for uncertain moments
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
- Low-Complexity Variable Forgetting Factor Mechanism for Blind Adaptive Constrained Constant Modulus Algorithms
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
- Exploiting sparsity in complex polynomial optimization
- Low-Complexity Blind Equalization for OFDM Systems With General Constellations
- A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- scientific article; zbMATH DE number 1820152 (Why is no real title available?)
- Bivalent quadratic optimization with sum-of-square of quadratic penalties
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Optimality conditions and optimization methods for quartic polynomial optimization
- Blind channel equalization using constrained generalized pattern search optimization and reinitialization strategy
This page was built for publication: Blind constant modulus equalization via convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353762)
