Solving Sum of Ratios Fractional Programs via Concave Minimization

By Harold P. Benson. 2007

52 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Control and Systems Engineering, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/f13961dec20a71facef14b4336eea122dad22d34

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Chrysanthos E. Gounaris
2. Christodoulos A. Floudas
3. John L. Klepeis

In Control and Systems Engineering

1. Christodoulos A. Floudas
2. Chrysanthos E. Gounaris
3. Ruth Misener

In Numerical Analysis

1. Christodoulos A. Floudas
2. Chrysanthos E. Gounaris
3. Ruth Misener

Citations in the corpus

• Fractional Programming for Communication Systems—Part I: Power Control and Beamforming (2018, unknown): “, using branch-and-bound search [15]–[17]).”
• A review of recent advances in global optimization (2009, methodology): “Benson (2006, 2007a) studied fractional programs that involve ratios of convex terms and presented a new branch and bound algorithm that requires solving a sequence of convex optimization problems.”