Abstract
A method is presented for solving the finite nonlinear min-max problem. Quasi-Newton methods are used to approximately solve a sequence of differentiable subproblems where, for each subproblem, the cost function to minimize is a global regularization underestimating the finite maximum function. Every cluster point of the sequence generated is shown to be a stationary point of the min-max problem and therefore, in the convex case, to be a solution of the problem. Moreover, numerical results are given for a large set of test problems which show that the method is efficient in practice.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Attouch and R.J.B. Wets, “Approximation and convergence in non-linear optimization,” in Nonlinear Programming, O. Mangasarian, R.R. Meyer, and S.M. Robinson (Eds.), Academic Press: New York, pp. 367- 394, 1980.
C. Charalambous and A.R. Conn, “An efficient method to solve the minmax problem directly,” SIAM J. Numer. Anal., vol. 15, pp. 162-187, 1978.
F.H. Clarke, “Generalized gradients and applications,” Trans. Amer. Math. Soc., vol. 205, pp. 247-262, 1975.
V.F. Demyanov and V.N. Malozemov, “On the theory of non-linear min-max problems,” Russian Math. Surveys, vol. 26, pp. 57-115, 1971.
C. Gígola and S. Gómez, “A regularization method for solving the finite convex min-max problem,” SIAM J. Numer. Anal., vol. 27, pp. 1621-1634, 1990.
S.P. Han, “Variable metric methods for minimizing a class of non-differentiable functions,” Math. Programming, vol. 20, pp. 1-13, 1981.
J.B. Hiriart-Urruty and C. Lemaréchal, “Convex analysis and minimization algorithms,” Grundlehren der Mathematischen Wissenschaften, vol. 305, Springer-Verlag: New York, 1993.
C. Lemaréchal and R. Mifflin (Eds.), Nonsmooth Optimization: Proceedings of a IIASA Workshop 1977 Laxenburg, IIASA Proceedings Series, vol. 3, Pergamon Press: Oxford, 1978.
B. Martinet, “Régularisation d'inéquations variationnelles par approximations succesives,” Rev. Francaise Inf. Rech. Oper., vol. R-3, pp. 154-179, 1970.
M. Minoux, Programmation Mathématique: Théorie et Algorithmes, Dunod: Paris, 1983.
W. Murray and M.L. Overton, “A projective Lagrange algorithm for nonlinear min-max optimization,” SIAM J. Sci. Statist. Comput., vol. 1, pp. 345-370, 1980.
R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970.
R.T. Rockafellar, “Monotone operators and proximal point algorithm,” SIAM J. Control and Optimization, vol. 14, pp. 877-898, 1976.
I. Zang, “A smoothing-out technique for min-max optimization,” Math. Programming, vol. 19, pp. 61-77, 1980.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Barrientos, O. A Global Regularization Method for Solving the Finite Min-Max Problem. Computational Optimization and Applications 11, 277–295 (1998). https://doi.org/10.1023/A:1018601319372
Issue Date:
DOI: https://doi.org/10.1023/A:1018601319372