Maximizing for the sum of ratios of two convex functions over a convex set

DOI10.1016/J.COR.2013.03.012zbMATH Open1348.90578OpenAlexW2062303963MaRDI QIDQ336507FDOQ336507

Peiping Shen, Weimin Li, Xiaodi Bai

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.03.012

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

zbMATH Keywords

global optimizationbranch and boundfractional programmingsum of ratios

Mathematics Subject Classification ID

Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Cites Work

• Title not available (Why is that?)
• Solving the sum-of-ratios problem by an interior-point method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Global optimization algorithm for the nonlinear sum of ratios problem
• 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
• Practical global optimization for multiview geometry
• Introduction to global optimization
• Fractional programming with convex quadratic forms and functions
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Fractional programming: Applications and algorithms
• Conical partition algorithm for maximizing the sum of dc ratios
• Global optimization for sum of generalized fractional functions
• Global optimization for sum of linear ratios problem with coefficients
• Title not available (Why is that?)
• A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
• A global optimization algorithm for linear fractional and bilinear programs
• Encyclopedia of optimization. In 6 vols.
• Solving sum of quadratic ratios fractional programs via monotonic function
• Global optimization for the sum of generalized polynomial fractional functions
• MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETS
• Maximizing the ratio of two convex functions over a convex set
• Maximization of the ratio of two convex quadratic functions over a polytope
• An efficient algorithm for solving convex-convex quadratic fractional programs

Cited In (12)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A potential practical algorithm for minimizing the sum of affine fractional functions
• Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem
• Maximizing the ratio of two convex functions over a convex set
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios
• Optimising portfolio diversification and dimensionality
• Fractional programming with convex quadratic forms and functions
• An efficient algorithm and complexity result for solving the sum of general affine ratios problem
• On Maximizing a Sum of Ratios
• Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
• A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming 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)