MERIT: A monotonically error-bound improving technique for unimodular quadratic programming

Author

Soltanalian, Mojtaba ; Stoica, Petre

Author_Institution

Dept. of Inf. Technol., Uppsala Univ., Uppsala, Sweden

fYear

2014

fDate

4-9 May 2014

Firstpage

5656

Lastpage

5660

Abstract

The NP-hard problem of optimizing a quadratic form over the unimodular vector set arises in radar code design scenarios as well as other active sensing and communication applications. To tackle this problem, a monotonically error-bound improving technique (MERIT) is proposed to obtain the global optimum or a local optimum of UQP with good sub-optimality guarantees. The provided sub-optimality guarantees are case-dependent and may outperform the π/4 approximation guarantee of semi-definite relaxation.

Keywords

computational complexity; matrix algebra; quadratic programming; MERIT technique; NP-hard problem; UQP; active sensing applications; communication applications; monotonically error-bound improving technique; radar code design scenarios; semidefinite relaxation; sub-optimality guarantees; unimodular quadratic programming; Acoustics; Approximation methods; Magneto electrical resistivity imaging technique; Optimization; Speech; Speech processing; Vectors; Code design; peak-to-average-power ratio (PAR); quadratic programming; radar codes; unimodular codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing (ICASSP), 2014 IEEE International Conference on

Conference_Location

Florence

Type

conf

DOI

10.1109/ICASSP.2014.6854686

Filename

6854686