An efficient algorithm of global optimization for sum of quadratic ratios problem with nonconvex quadratic constraints
From MaRDI portal
Publication:3072073
Recommendations
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global optimization algorithm for sum of quadratic ratios problem
- An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
Cited in
(11)- 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 outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- scientific article; zbMATH DE number 6130268 (Why is no real title available?)
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- scientific article; zbMATH DE number 7234393 (Why is no real title available?)
- Global optimization algorithm for sum of quadratic ratios problem
- Solving sum of quadratic ratios fractional programs via monotonic function
- An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem
This page was built for publication: An efficient algorithm of global optimization for sum of quadratic ratios problem with nonconvex quadratic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3072073)
