A global optimization algorithm for sum of quadratic ratios problem with coefficients
From MaRDI portal
(Redirected from Publication:440994)
Recommendations
- Global optimization algorithm for sum of quadratic ratios problem
- An efficient algorithm of global optimization for sum of quadratic ratios problem with nonconvex quadratic constraints
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Global optimization for sum of linear ratios problem with coefficients
- A global optimization algorithm for sum of linear ratios problem
- A global optimization algorithm for sum of linear ratios problem
- scientific article; zbMATH DE number 5631536
- Global optimization algorithm for a class of sum of linear ratios problem
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Global optimization algorithm for solving sum of linear ratios problems
Cites work
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A conic trust-region method for nonlinearly constrained optimization
- An approximate approach for fractional programming with absolute-value functions
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Conic Approximations and Collinear Scalings for Optimizers
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
- Fractional programming with absolute-value functions
- Global optimization algorithm for the nonlinear sum of ratios problem
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Maximization of the ratio of two convex quadratic functions over a polytope
- Minimization of the sum of three linear fractional functions
- On the global optimization of sums of linear fractional functions over a convex set
- Parametric approaches to fractional programs
- Solving the sum-of-ratios problem by an interior-point method
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
Cited in
(7)- A parametric solution method for a generalized fractional programming problem
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- 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?)
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- A branch-and-cut algorithm for a class of sum-of-ratios problems
This page was built for publication: A global optimization algorithm for sum of quadratic ratios problem with coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q440994)
