An efficient algorithm and complexity result for solving the sum of general affine ratios problem

DOI10.1016/J.CHAOS.2022.112701OpenAlexW4297102110MaRDI QIDQ2680084

Junqiao Ma, Hong-Wei Jiao

Publication date: 26 January 2023

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.chaos.2022.112701

zbMATH Keywords

global optimizationbranch-and-boundcomplexity analysisaccelerating technicsum of general affine ratios

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Fractional programming (90C32) Linear programming (90C05)

Related Items (3)

An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ 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

Uses Software

• WinGULF
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Range division and contraction algorithm for a class of global optimization problems
• A practicable branch and bound algorithm for sum of linear ratios problem
• 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 global optimization algorithm for sum of linear ratios problem
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• A branch-and-cut algorithm for a class of sum-of-ratios problems
• On the global optimization of sums of linear fractional functions over a convex set
• Regional division and reduction algorithm for minimizing the sum of linear fractional functions
• A deterministic global optimization algorithm
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• Image space analysis of generalized fractional programs
• Linear-fractional programming. Theory, methods, applications and software.
• A unified monotonic approach to generalized linear fractional programming
• On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
• Range division and linearization algorithm for a class of linear ratios optimization problems
• BARON: A general purpose global optimization software package
• A practical but rigorous approach to sum-of-ratios optimization in geometric applications
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• A global optimization algorithm for linear fractional programming
• A practicable contraction approach for the sum of the generalized polynomial ratios problem
• Global optimization for sum of linear ratios problem with coefficients
• Fractional programming: The sum-of-ratios case
• Solving generalized polynomial problem by using new affine relaxed technique
• Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• Semidefinite relaxations of fractional programs via novel convexification techniques

This page was built for publication: An efficient algorithm and complexity result for solving the sum of general affine ratios problem