Global optimization for the sum of generalized polynomial fractional functions
From MaRDI portal
Publication:2460040
DOI10.1007/s00186-006-0130-0zbMath1180.90331OpenAlexW2053602249MaRDI QIDQ2460040
Publication date: 14 November 2007
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-006-0130-0
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Fractional programming (90C32)
Related Items
A review of recent advances in global optimization, Maximizing for the sum of ratios of two convex functions over a convex set, Global optimization algorithm for sum of generalized polynomial ratios problem, A linearized relaxing algorithm for the specific nonlinear optimization problem, On the quadratic fractional optimization with a strictly convex quadratic constraint, Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models, A practicable contraction approach for the sum of the generalized polynomial ratios problem, Global minimization for generalized polynomial fractional program, Global optimization for the sum of certain nonlinear functions, Range division and compression algorithm for quadratically constrained sum of quadratic ratios, Global optimization for the generalized polynomial sum of ratios problem, Global optimization for sum of geometric fractional functions, A geometric branch and bound method for robust maximization of convex functions, Solving sum of quadratic ratios fractional programs via monotonic function, A parametric solution method for a generalized fractional programming problem, FGP approach to quadratically constrained multi-objective quadratic fractional programming with parametric functions
Cites Work
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Optimization on low rank nonconvex structures
- Computation and application of Taylor polynomials with interval remainder bounds
- A unified monotonic approach to generalized linear fractional programming
- Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
- Minimization of the sum of three linear fractional functions
- Optimization of polynomial fractional functions
- Convex analysis and global optimization
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- Maximization of the ratio of two convex quadratic functions over a polytope
- Global optimization algorithm for the nonlinear sum of ratios problem
