A potential practical algorithm for minimizing the sum of affine fractional functions

DOI10.1080/02331934.2022.2032051zbMATH Open1519.90242OpenAlexW4210839712MaRDI QIDQ6106325FDOQ6106325

Hong-Wei Jiao, Rongjiang Chen, Youlin Shang

Publication date: 27 June 2023

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2022.2032051

Recommendations

• Regional division and reduction algorithm for minimizing the sum of linear fractional functions
• Minimizing the sum of a convex function and the product of two affine functions over a convex set
• Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
• Minimization of the sum of three linear fractional functions
• Global optimization for sum of geometric fractional functions

zbMATH Keywords

computational complexityglobal optimizationbranch and boundsum of affine fractional functionstwo-level affine relaxation technique

Mathematics Subject Classification ID

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

Cites Work

• Fractional programming: The sum-of-ratios case
• A sixth bibliography of fractional programming
• Title not available (Why is that?)
• A new reformulation-linearization technique for bilinear programming problems
• A global optimization algorithm for linear fractional programming
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• A unified monotonic approach to generalized linear fractional programming
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• A hybrid LP/NLP paradigm for global optimization relaxations
• Image space analysis of generalized fractional programs
• Linear-fractional programming. Theory, methods, applications and software.
• A branch and bound algorithm to globally solve the sum of several linear ratios
• A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
• A practicable branch and bound algorithm for sum of linear ratios problem
• Global optimization algorithm for sum of generalized polynomial ratios problem
• Linear decomposition approach for a class of nonconvex programming problems
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• A global optimization algorithm for linear fractional and bilinear programs
• Maximizing for the sum of ratios of two convex functions over a convex set
• A global optimization algorithm for sum of linear ratios problem
• A deterministic global optimization algorithm
• Approximation of linear fractional-multiplicative problems
• Title not available (Why is that?)
• On Maximizing a Sum of Ratios
• Title not available (Why is that?)
• Regional division and reduction algorithm for minimizing the sum of linear fractional functions
• A eighth bibliography of fractional programming
• A ninth bibliography of fractional programming
• Range division and linearization algorithm for a class of linear ratios optimization problems
• A practical but rigorous approach to sum-of-ratios optimization in geometric applications
• A practicable contraction approach for the sum of the generalized polynomial ratios problem

Cited In (4)

• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
• An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
• Global algorithm for effectively solving min-max affine fractional programs
• Title not available (Why is that?)

This page was built for publication: A potential practical algorithm for minimizing the sum of affine fractional functions

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