A practical but rigorous approach to sum-of-ratios optimization in geometric applications

DOI10.1007/s10589-012-9488-5zbMath1267.90150OpenAlexW2039338617MaRDI QIDQ1938908

Takahito Kuno, Toshiyuki Masaki

Publication date: 25 February 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://tsukuba.repo.nii.ac.jp/record/28151/files/COA_54-1.pdf

zbMATH Keywords

global optimizationcomputer visionbranch-and-boundmultiple-view geometrysum-of-ratios optimization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32)

Related Items

Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ A potential practical algorithm for minimizing the sum of affine fractional functions ⋮ A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ An exact method for solving the integer sum of linear ratios problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• Using concave envelopes to globally solve the nonlinear sum of ratios problem
• A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
• Practical global optimization for multiview geometry
• Minimizing support structures and trapped area in two-dimensional layered manufacturing
• On minimum-area hulls
• Solving the sum-of-ratios problem by an interior-point method
• Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
• \(NP\)-hardness of linear multiplicative programming and related problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
• Programming with linear fractional functionals
• An Algorithm for Separable Nonconvex Programming Problems
• Convex analysis and global optimization
• Global optimization algorithm for the nonlinear sum of ratios problem