Maximizing for the sum of ratios of two convex functions over a convex set
From MaRDI portal
(Redirected from Publication:336507)
Recommendations
- Maximizing the ratio of two convex functions over a convex set
- Maximization of the ratio of two convex quadratic functions over a polytope
- On the global optimization for a class of sum of convex-convex ratios problem
- Duality for a sum of convex ratios
- On minimizing the sum of a convex function and a concave function
- On the maximization of (not necessarily) convex functions on convex sets
- scientific article; zbMATH DE number 2221682
- On constrained maxima of convex functions
- scientific article; zbMATH DE number 6438525
- Global optimization for the sum of concave-convex ratios problem
Cites work
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A global optimization algorithm for linear fractional and bilinear programs
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- An efficient algorithm for solving convex-convex quadratic fractional programs
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Conical partition algorithm for maximizing the sum of dc ratios
- Encyclopedia of optimization. In 6 vols.
- Fractional programming with convex quadratic forms and functions
- Fractional programming: Applications and algorithms
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global optimization for sum of generalized fractional functions
- Global optimization for sum of linear ratios problem with coefficients
- Global optimization for the sum of generalized polynomial fractional functions
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Introduction to global optimization
- Maximization of the ratio of two convex quadratic functions over a polytope
- MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETS
- Maximizing the ratio of two convex functions over a convex set
- Practical global optimization for multiview geometry
- Solving sum of quadratic ratios fractional programs via monotonic function
- 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
(19)- Using conical partition to globally maximizing the nonlinear sum of ratios
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
- Global optimization for the sum of concave-convex ratios problem
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
- Fractional programming with convex quadratic forms and functions
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- Optimising portfolio diversification and dimensionality
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- scientific article; zbMATH DE number 4176854 (Why is no real title available?)
- On the global optimization for a class of sum of convex-convex ratios problem
- On Maximizing a Sum of Ratios
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
- scientific article; zbMATH DE number 6438525 (Why is no real title available?)
- Maximizing the ratio of two convex functions over a convex set
- A potential practical algorithm for minimizing the sum of affine fractional functions
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
This page was built for publication: Maximizing for the sum of ratios of two convex functions over a convex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336507)
