Tractable continuous approximations for constraint selection via cardinality minimization
ArticleDownload View PDF
approximation methods
HEURISTIC ALGORITHMS FOR DESIGNING UNIMODULAR CODE SEQUENCES WITH PERFORMANCE GUARANTEES
In this study, we develop heuristic methods to solve unimodular quadratic programming (UQP) approximately, which is known to be NP-hard. UQP-type problems appear naturally in radar waveform design and active sensing applications. In the UQP framework, we optimize a sequence of complex variables with unit modulus by maximizing a quadratic function. To solve the UQP … Read more