Using concave envelopes to globally solve the nonlinear sum of ratios problem
From MaRDI portal
Publication:598606
DOI10.1023/A:1013869015288zbMath1045.90069OpenAlexW1505348331MaRDI QIDQ598606
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
Related Items
Minimizing the sum of many rational functions, Global solutions to fractional programming problem with ratio of nonconvex functions, A practicable branch and bound algorithm for sum of linear ratios problem, An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints, 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 branch-bound cut technique for non-linear fractional multi-objective optimization problems, A linearized relaxing algorithm for the specific nonlinear optimization problem, Minimization of isotonic functions composed of Fractions, A new deterministic global computing algorithm for solving a kind of linear fractional programming, A practical but rigorous approach to sum-of-ratios optimization in geometric applications, Effective algorithm and computational complexity for solving sum of linear ratios problem, A global optimization algorithm for sum of quadratic ratios problem with coefficients, Using conical partition to globally maximizing the nonlinear sum of ratios, Global optimization for a class of nonlinear sum of ratios problem, Global optimization for the sum of generalized polynomial fractional functions, A branch-and-cut algorithm for a class of sum-of-ratios problems, Existence and sum decomposition of vertex polyhedral convex envelopes, Practical global optimization for multiview geometry, Solving sum of ratios fractional programs via concave minimization, Efficient local search procedures for quadratic fractional programming problems, Solving fractional problems with dynamic multistart improving hit-and-run, A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem, 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, Solving the sum-of-ratios problems by a harmony search algorithm, Global optimization of nonlinear sum of ratios problem, Global optimization for the generalized polynomial sum of ratios problem, Minimizing the object space error for pose estimation: towards the most efficient algorithm, Global optimization for sum of linear ratios problem with coefficients, Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs, Global optimization for sum of geometric fractional functions, Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem, Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region, Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming, Solving the sum-of-ratios problem by a stochastic search algorithm, Solving sum of quadratic ratios fractional programs via monotonic function, A parametric solution method for a generalized fractional programming problem, Global optimization for a class of fractional programming problems, A branch and bound algorithm to globally solve the sum of several linear ratios, Global optimization for the sum of concave-convex ratios problem, A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems, An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
Uses Software
