Abstract
The problem of minimizing maxmin-type functions or the sum of minimum-type functions appears to be increasingly interesting from both theoretical and practical considerations. Such functions are essentially nonsmooth and, in general, they can successfully be treated by existing tools of Nonsmooth Analysis. In some cases the problem of finding a minimizer of such a function can be reduced to solving some mixed combinatorial-continuous problem.
In the present paper the problem of minimizing the sum of minima of a finite number of functions is discussed. It is shown that this problem is equivalent to solving a finite (though may be quite large) number of simpler (and sometimes quite trivial) optimization problems. Necessary conditions for global a minimum and sufficient conditions for a local minimum are stated. An algorithm for finding a local minimizer (the so-called exchange algorithm) is proposed. It converges to a local minimizer in a finite number of steps. A more general algorithm (called ε-exchange algorithm) is described which allows one to escape from a local minimum point. Numerical examples demonstrate the algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bagirov, A.M., Rubinov, A.M. (1999), Global Optimization of IPH functions over the unit simplex with applications to cluster analysis, In Proceedings of the Third Australia-Japan Joint Workshop on Intelligent and Evolutionary Systems, Canberra, Australia, pp. 191–192.
Bagirov, A.M., Rubinov, A.M. and Yearwood J. (2001), Using global optimization to improve classification for medical diagnosis, Topics in Health Information Management, Vol. 22, pp. 65–74.
Mangasarian, O.L. (1997), Mathematical Programming in Data Mining, Data Mining and Knowledge Discovery, Vol. 1, pp. 183–201.
Polak E. (1971), Computational Methods in Optimization; A unified approach, Academic Press, New York, NY.
Rao, M.R. (1971), Cluster analysis and mathematical programming, Journal of the American Statistical Association, Vol. 66, pp. 622–626.
Rubinov, A.M. (2000), Abstract Convexity and Global Optimization, Kluwer Academic Publishers, Dordrecht.
Vershik, A.M., Malozemov, V.N., Pevnyi, A.B. (1975), The best piecewise polynomial approximation, Siberian Mathematical Journal, Vol. XVI, Nr. 5, pp. 925–938.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Demyanov, A.V. (2005). An Exchange Algorithm for Minimizing Sum-Min Functions. In: Qi, L., Teo, K., Yang, X. (eds) Optimization and Control with Applications. Applied Optimization, vol 96. Springer, Boston, MA. https://doi.org/10.1007/0-387-24255-4_9
Download citation
DOI: https://doi.org/10.1007/0-387-24255-4_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-24254-5
Online ISBN: 978-0-387-24255-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)