New Results on Generalized Fractional Programming Problems With Toeplitz Quadratics
Authors:
- 21 April 2016
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 23 (6) , 848-852
Abstract
We develop a polynomial-time procedure to handle a class of generalized fractional programming (GFP) problems with Toeplitz-Hermitian quadratics exploiting the linear matrix inequality (LMI) representation of the finite autocorrelation sequences cone, the spectral factorization theorem, and the Dinkelback's algorithm. For the special case of fractional quadratic programming (FQP) problems, we also provide a SemiDefinite programming (SDP) reformulation of the resulting non-convex optimization by means of the Charnes-Cooper transformation. Finally, we focus on an interesting radar signal processing application to assess the effectiveness of the devised optimization tool.Keywords
This publication has 19 references indexed in Scilit:
- A dual function radar-communications system using sidelobe control and waveform diversity2015
- Parametric Frugal Sensing of Power Spectra for Moving Average ModelsIEEE Transactions on Signal Processing, 2014
- Convex Optimization2004
- Convex optimization problems involving finite autocorrelation sequencesMathematical Programming, 2002
- Lectures on Modern Convex Optimization2001
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- Robust adaptive beamforming for wide-band, moving, and coherent jammers via uniform linear arraysIEEE Transactions on Antennas and Propagation, 1999
- A new algorithm for generalized fractional programsMathematical Programming, 1996
- Algorithms for generalized fractional programmingMathematical Programming, 1991
- Programming with linear fractional functionalsNaval Research Logistics Quarterly, 1962