Minimizing support structures and trapped area in two-dimensional layered manufacturing
Computational Geometry: Theory and Applications
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Solving the Sum-of-Ratios Problem by an Interior-Point Method
Journal of Global Optimization
A branch-and-bound algorithm for maximizing the sum of several linear ratios
Journal of Global Optimization
Using concave envelopes to globally solve the nonlinear sum of ratios problem
Journal of Global Optimization
Global optimization algorithm for the nonlinearsum of ratios problem
Journal of Optimization Theory and Applications
A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems
Journal of Global Optimization
Triangulation for points on lines
Image and Vision Computing
Practical Global Optimization for Multiview Geometry
International Journal of Computer Vision
Optimal algorithms in multiview geometry
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part I
Hi-index | 0.00 |
In this paper, we develop an algorithm for minimizing the L q norm of a vector whose components are linear fractional functions, where q is an arbitrary positive integer. The problem is a kind of sum-of-ratios optimization problem, and often occurs in computer vision. In that case, it is characterized by a large number of ratios and a small number of variables. The algorithm we propose here exploits this feature and generates a globally optimal solution in a practical amount of computational time.