Global algorithm for effectively solving min-max affine fractional programs

DOI10.1007/S12190-024-02027-1MaRDI QIDQ6584742zbMATH OpenFDO

Authors Hong-Wei Jiao, Yudong Sun, Wenjie Wang, Youlin Shang

Publication date 8 August 2024

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12190-024-02027-1

zbMATH Keywords

algorithmic complexitybranch-relaxation-bound algorithmlinear relaxation techniquemin-max affine fractional programs

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32) Minimax problems in mathematical programming (90C47)

Cites work

• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
• A DC approach for minimax fractional optimization programs with ratios of convex functions
• A hybrid LP/NLP paradigm for global optimization relaxations
• A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
• A new linearization technique for minimax linear fractional programming
• A potential practical algorithm for minimizing the sum of affine fractional functions
• A unified monotonic approach to generalized linear fractional programming
• An effective branch and bound algorithm for minimax linear fractional programming
• An interior-point method for fractional programs with convex constraints
• An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Effective algorithm and computational complexity for solving sum of linear ratios problem
• Efficient algorithm for globally computing the min–max linear fractional programming problem
• Generalized fractional programming and cutting plane algorithms
• scientific article; zbMATH DE number 6907481 (Why is no real title available?)
• scientific article; zbMATH DE number 757682 (Why is no real title available?)
• scientific article; zbMATH DE number 2196500 (Why is no real title available?)
• Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem
• Interval division and linearization algorithm for minimax linear fractional program
• Lower subdifferentiability in minimax fractional programming^*
• Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
• On Minimax Fractional Semi-Infinite Programming Problems with Applications
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
• Solving long-term financial planning problems via global optimization
• Two-level linear relaxation method for generalized linear fractional programming

Cited in

(2)

• Optimizing the minimax affine fractional problem in reduced space
• An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule

This page was built for publication: Global algorithm for effectively solving min-max affine fractional programs

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