Global optimization for the sum of generalized polynomial fractional functions

DOI10.1007/S00186-006-0130-0MaRDI QIDQ2460040zbMATH OpenOpenAlexFDO

Authors Gui-Xia Yuan, Peiping Shen

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

zbMATH Keywords

branch and boundgeneralized polynomial constraintlinear relaxation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Global optimization for sum of generalized fractional functions
• Global optimization for sum of geometric fractional functions
• Global optimization of generalized linear fractional programming with nonlinear constraints
• Global minimization for generalized polynomial fractional program
• Global optimization algorithm for sum of generalized polynomial ratios problem

Cites work

• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• A unified monotonic approach to generalized linear fractional programming
• Computation and application of Taylor polynomials with interval remainder bounds
• Convex analysis and global optimization
• Global optimization algorithm for the nonlinear sum of ratios problem
• Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
• Maximization of the ratio of two convex quadratic functions over a polytope
• Minimization of the sum of three linear fractional functions
• Optimization of polynomial fractional functions
• Optimization on low rank nonconvex structures
• Using concave envelopes to globally solve the nonlinear sum of ratios problem

Cited in

(20)

• Solving sum of quadratic ratios fractional programs via monotonic function
• A linearized relaxing algorithm for the specific nonlinear optimization problem
• Global minimization for generalized polynomial fractional program
• Global optimization for the sum of certain nonlinear functions
• Optimization of polynomial fractional functions
• A geometric branch and bound method for robust maximization of convex functions
• A parametric solution method for a generalized fractional programming problem
• FGP approach to quadratically constrained multi-objective quadratic fractional programming with parametric functions
• 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 optimization for sum of generalized fractional functions
• On the quadratic fractional optimization with a strictly convex quadratic constraint.
• Maximizing for the sum of ratios of two convex functions over a convex set
• Global optimization algorithm for sum of generalized polynomial ratios problem
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios
• Global optimization for the generalized polynomial sum of ratios problem
• A branch and bound algorithm for solving the sum of generalized polynomial fractional programming problem
• On the global optimization of sums of linear fractional functions over a convex set
• A review of recent advances in global optimization
• Global optimization for sum of geometric fractional functions

This page was built for publication: Global optimization for the sum of generalized polynomial fractional functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460040)