Using concave envelopes to globally solve the nonlinear sum of ratios problem
From MaRDI portal
Publication:598606
DOI10.1023/A:1013869015288zbMATH Open1045.90069OpenAlexW1505348331MaRDI QIDQ598606FDOQ598606
Authors: Harold P. Benson 
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013869015288
Recommendations
Cited In (45)
- Efficient local search procedures for quadratic fractional programming problems
- Global optimization for the sum of concave-convex ratios problem
- Minimizing the sum of many rational functions
- Global optimization for the sum of generalized polynomial fractional functions
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Global optimization for a class of nonlinear sum of ratios problem
- Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation
- Practical global optimization for multiview geometry
- Solving the sum-of-ratios problem by a stochastic search algorithm
- Global optimization for sum of geometric fractional functions
- Global solutions to fractional programming problem with ratio of nonconvex functions
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- A practicable branch and bound algorithm for sum of linear ratios problem
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Solving fractional problems with dynamic multistart improving hit-and-run
- Global optimization for a class of fractional programming problems
- Minimization of isotonic functions composed of Fractions
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems
- Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- Optimal spares allocation to an exchangeable-item repair system with tolerable wait
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- Global optimization of nonlinear sum of ratios problem
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- A linearized relaxing algorithm for the specific nonlinear optimization problem
- Maximizing for the sum of ratios of two convex functions over a convex set
- Existence and sum decomposition of vertex polyhedral convex envelopes
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Solving the sum-of-ratios problems by a harmony search algorithm
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications
- Minimizing the object space error for pose estimation: towards the most efficient algorithm
- Global optimization for the generalized polynomial sum of ratios problem
- A parametric solution method for a generalized fractional programming problem
- Solving sum of quadratic ratios fractional programs via monotonic function
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Solving sum of ratios fractional programs via concave minimization
- A new deterministic global computing algorithm for solving a kind of linear fractional programming
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
- Global optimization for sum of linear ratios problem with coefficients
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- 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
Uses Software
This page was built for publication: Using concave envelopes to globally solve the nonlinear sum of ratios problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598606)
