A global optimization algorithm for sum of quadratic ratios problem with coefficients

DOI10.1016/j.amc.2012.03.083zbMath1245.90089OpenAlexW2058005260MaRDI QIDQ440994

Pengyu Lu, Yijun Li, Ying Ji

Publication date: 19 August 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.03.083

zbMATH Keywords

global convergencebranch and boundlinearization relaxationquadratic constraints problemquadratic ratios problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (4)

A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ A parametric solution method for a generalized fractional programming problem

Uses Software

• eigs
• IRAM

Cites Work

• Unnamed Item
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• Using concave envelopes to globally solve the nonlinear sum of ratios problem
• On the global optimization of sums of linear fractional functions over a convex set
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• Minimization of the sum of three linear fractional functions
• Solving the sum-of-ratios problem by an interior-point method
• An approximate approach for fractional programming with absolute-value functions
• Fractional programming with absolute-value functions
• Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
• An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
• Conic Approximations and Collinear Scalings for Optimizers
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Parametric approaches to fractional programs
• Maximization of the ratio of two convex quadratic functions over a polytope
• A conic trust-region method for nonlinearly constrained optimization
• Global optimization algorithm for the nonlinear sum of ratios problem

This page was built for publication: A global optimization algorithm for sum of quadratic ratios problem with coefficients