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

Takahito Kuno () and Toshiyuki Masaki

Computational Optimization and Applications, 2013, vol. 54, issue 1, 93-109

Abstract: 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. Copyright Springer Science+Business Media, LLC 2013

Keywords: Global optimization; Sum-of-ratios optimization; Branch-and-bound; Computer vision; Multiple-view geometry (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-012-9488-5 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:54:y:2013:i:1:p:93-109

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-012-9488-5

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().