Global optimization algorithm for sum of quadratic ratios problem

MaRDI QIDQ3573741zbMATH OpenFDO

Authors Xiaoai Li, Kai Zheng, Peiping Shen

Publication date 8 July 2010

zbMATH Keywords

branch and boundlinear relaxationsum of quadratic ratios

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Optimality conditions and duality in mathematical programming (90C46) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• An efficient algorithm of global optimization for sum of quadratic ratios problem with nonconvex quadratic constraints
• A global optimization algorithm for sum of linear ratios problem
• Global optimization algorithm for the nonlinear sum of ratios problem
• Global optimization of nonlinear sum of ratios problem
• Global optimization algorithm for sum of generalized polynomial ratios problem

Cited in

(9)

• Solving sum of quadratic ratios fractional programs via monotonic function
• An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients
• An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
• An efficient algorithm of global optimization for sum of quadratic ratios problem with nonconvex quadratic constraints
• scientific article; zbMATH DE number 7234393 (Why is no real title available?)
• Global optimization algorithm for sum of generalized polynomial ratios problem
• A global optimization algorithm for sum of quadratic ratios problem with coefficients
• An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
• Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs

This page was built for publication: Global optimization algorithm for sum of quadratic ratios problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3573741)