An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
From MaRDI portal
Publication:2116605
DOI10.1007/s10957-021-01992-yzbMath1487.90536OpenAlexW4210927028MaRDI QIDQ2116605
Bo Zhang, Xia Liu, Xiao Li Huang, Yuelin Gao
Publication date: 18 March 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01992-y
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)
Uses Software
Cites Work
- Unnamed Item
- A practicable branch and bound algorithm for sum of linear ratios problem
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- The fractional minimal cost flow problem on network
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- Global optimization of nonlinear sum of ratios problem
- On the global optimization of sums of linear fractional functions over a convex set
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- Solving sum of quadratic ratios fractional programs via monotonic function
- Global optimization for a class of fractional programming problems
- Generalized concavity
- A new technique for generating quadratic programming test problems
- Image space analysis of generalized fractional programs
- Handbook of global optimization
- Financial planning with fractional goals
- 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
- Minimization of the sum of three linear fractional functions
- Solving the sum-of-ratios problem by an interior-point method
- Range division and linearization algorithm for a class of linear ratios optimization problems
- An interior-point method for generalized linear-fractional programming
- On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- On a self-consistent-field-like iteration for maximizing the sum of the Rayleigh quotients
- Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- \(NP\)-hardness of linear multiplicative programming and related problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem
- Downside Risk Approach for Multi-Objective Portfolio Optimization
- A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere
- A ninth bibliography of fractional programming
- Programming with linear fractional functionals
- On Nonlinear Fractional Programming
- Fractional programming
- Introduction to global optimization.
This page was built for publication: An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
