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.
Similar content being viewed by others
References
Almogy, Y., Levin, O.: Parametric analysis of a multi-stage stochastic shipping problem. In: Proceedings of the Fifth IFORS Conference, Venice, pp. 359–370 (1969)
Arkin, E.M., Chiang, Y.-J., Held, M., Mitchell, J.S.B., Sacristan, V., Skiena, S.S., Yang, T.-C.: On minimum-area hulls. Algorithmica 21, 119–136 (1998)
Bartoli, A., Lapreste, J.-T.: Triangulation for points on lines. Image Vis. Comput. 26, 315–324 (2008)
Benson, H.P.: Global optimization algorithm for the nonlinear sum of ratios problem. J. Optim. Theory Appl. 112, 1–29 (2002)
Benson, H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. J. Glob. Optim. 22, 343–364 (2002)
Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Nav. Res. Logist. Q. 9, 181–186 (1962)
Chen, D.Z., Daescu, O., Dai, Y., Katoh, N., Wu, X., Xu, J.: Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications. J. Comb. Optim. 9, 69–90 (2005)
Falk, J.E., Soland, R.M.: An algorithm for separable nonconvex programming problems. Manag. Sci. 15, 550–569 (1969)
Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. J. Glob. Optim. 19, 83–102 (2001)
Octave GNU: http://www.gnu.org/software/octave/
Hartley, R., Kahl, F.: Optimal algorithms in multiview geometry. In: Proceedings of the Asian Conference on Computer Vision, vol. 1, pp. 13–34 (2007)
Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 2nd edn. Springer, Berlin (1993)
Kahl, F., Agarwal, S., Chandraker, M.K., Kriegman, D., Belongie, S.: Practical global optimization for multiview geometry. Int. J. Comput. Vis. 79, 271–284 (2008)
Konno, H., Inori, M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32, 143–158 (1989)
Konno, H., Watanabe, H.: Bond portfolio optimization problems and their applications to index tracking: a partial optimization approach. J. Oper. Res. Soc. Jpn. 39, 295–306 (1996)
Kuno, T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Glob. Optim. 22, 155–174 (2002)
Kuno, T.: A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-ratios problems. J. Glob. Optim. 33, 435–464 (2005)
Majhi, J., Janardan, R., Schwerdt, J., Smid, M., Gupta, P.: Minimizing support structures and trapped area in two-dimensional layered manufacturing. Comput. Geom. 12, 241–267 (1999)
Mangasarian, O.L.: Nonlinear Programming. Krieger, Melbourne (1969)
Matsui, T.: NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9, 113–119 (1996)
Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. Assoc. Comput. Mach. 31, 114–127 (1984)
Tuy, H.: Convex Analysis and Global Optimization. Kluwer Academic, Dordrecht (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
T. Kuno was partially supported by a Grant-in-Aid for Challenging Exploratory Research (22651057) from the Japan Society for the Promotion of Sciences.
Rights and permissions
About this article
Cite this article
Kuno, T., Masaki, T. A practical but rigorous approach to sum-of-ratios optimization in geometric applications. Comput Optim Appl 54, 93–109 (2013). https://doi.org/10.1007/s10589-012-9488-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-012-9488-5