Quadratic Transform for Fractional Programming in Signal Processing and Machine Learning
arXiv:2503.09977 · doi:10.1109/MSP.2025.3557958
Abstract
Fractional programming (FP) is a branch of mathematical optimization that deals with the optimization of ratios. It is an invaluable tool for signal processing and machine learning, because many key metrics in these fields are fractionally structured, e.g., the signal-to-interference-plus-noise ratio (SINR) in wireless communications, the Cramér-Rao bound (CRB) in radar sensing, the normalized cut in graph clustering, and the margin in support vector machine (SVM). This article provides a comprehensive review of both the theory and applications of a recently developed FP technique known as the quadratic transform, which can be applied to a wide variety of FP problems, including both the minimization and the maximization of the sum of functions of ratios as well as matrix-ratio problems.
20 pages
References in corpus (5)
- Fractional Programming for Communication Systems--Part I: Power Control and Beamforming
- Fractional Programming for Communication Systems--Part II: Uplink Scheduling via Matching
- Energy-Efficient Scheduling and Power Allocation in Downlink OFDMA Networks with Base Station Coordination
- A Novel Normalized-Cut Solver with Nearest Neighbor Hierarchical Initialization
- Mixed Max-and-Min Fractional Programming for Wireless Networks