An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems

DOI10.1007/S10957-023-02368-0MaRDI QIDQ6493959zbMATH OpenFDO

Authors Hong-Wei Jiao, Binbin Li, Youlin Shang

Publication date 29 April 2024

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10957-023-02368-0

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Recommendations

• An out space accelerating algorithm for generalized affine multiplicative programs problem
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• Two-level linear relaxation method for generalized linear fractional programming
• An \(\varepsilon\)-approximation algorithm for generalized fractional programs

Cited in

(12)

• Global algorithm for effectively solving min-max affine fractional programs
• A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
• Quadratic convex-concave minimax optimization
• A hybrid relaxation method for solving generalized linear fractional programs
• Reduced outer space algorithm for globally computing affine sum-of-ratios problems
• Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems
• An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
• An efficient algorithm via a novel one-parameter filled function based on general univariate functions for unconstrained global optimization
• Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
• Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs
• Globally minimizing a class of fractional multiplicative problems using the separability of relaxation problem
• Convex relaxation technique-based output space branch-reduction-bound algorithm for minimizing generalized linear fractional multiplicative programs

This page was built for publication: An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems

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