Skip to main content
Log in

First-Order Algorithms for Generalized Semi-Infinite Min-Max Problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We present a first-order algorithm for solving semi-infinite generalized min-max problems which consist of minimizing a function f0(x) = F(ψ1(x), .... , ψm(x)), where F is a smooth function and each ψi is the maximum of an infinite number of smooth functions.

In Section 3.3 of [17] Polak finds a methodology for solving infinite dimensional problems by expanding them into an infinite sequence of consistent finite dimensional approximating problems, and then using a master algorithm that selects an appropriate subsequence of these problems and applies a number of iterations of a finite dimensional optimization algorithm to each of these problems, sequentially. Our algorithm was constructed within this framework; it calls an algorithm by Kiwiel as a subroutine. The number of iterations of the Kiwiel algorithm to be applied to the approximating problems is determined by a test that ensures that the overall scheme retains the rate of convergence of the Kiwiel algorithm.

Under reasonable assumptions we show that all the accumulation points of sequences constructed by our algorithm are stationary, and, under an additional strong convexity assumption, that the Kiwiel algorithm converges at least linearly, and that our algorithm also converges at least linearly, with the same rate constant bounds as Kiwiel's.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. P. Bertsekas, “Nondifferentiable optimization via approximation,” Mathematical Programming Study, vol. 3, pp. 1-25, 1975.

    Google Scholar 

  2. V. F. Dem'yanov, “Quasidifferentiable functions: necessary conditions and descent directions”, Mathematical Programming Study, vol. 29, pp. 20-43, 1986.

    Google Scholar 

  3. V. F. Dem'yanov, S. Gamidov, and I. T. Sivelina, “An algorithm for minimizing a certain class of quasidifferentiable functions”, Mathematical Programming Study, vol. 29, pp. 74-84, 1986.

    Google Scholar 

  4. V. F. Dem'yanov and A. M. Rubinov, Quasidifferential Calculus, Optimization Software Inc.: New York, 1986.

    Google Scholar 

  5. G. Di Pillo, L. Grippo, and S. Lucidi, “A smooth transformation of the generalized minimax problem”, Journal of Optimization Theory and Applications vol. 95, pp. 1-24, 1997.

    Google Scholar 

  6. M. Fukushima, “A descent algorithm for nonsmooth convex optimization,” Mathematical Programming, vol. 30, pp. 163-175, 1984.

    Google Scholar 

  7. K. C. Kiwiel, “A quadratic approximation method for minimizing a class of quasidifferentiable functions,” Numerische Mathematik, vol. 45, 411-430, 1984.

    Google Scholar 

  8. K.C. Kiwiel, “A linearization method for minimizing certain quasidifferentiable functions,” Mathematical Programming Study, vol. 29, pp. 85-94, 1986.

    Google Scholar 

  9. K. C. Kiwiel, “Randomized search directions in descent methods for minimizing certain quasidifferentiable functions,” Optimization, vol. 17, pp. 475-485, 1986.

    Google Scholar 

  10. K. C. Kiwiel, “Descent methods for quasidifferentiable minimization,” Applied Mathematics and Optimization, vol. 18, pp. 163-180, 1988.

    Google Scholar 

  11. L. Kuntz and A. Pielczyk, “The method of common descent for a certain class of quasidifferentiable functions,” Optimization, vol. 22, pp. 669-679, 1991.

    Google Scholar 

  12. G. Papavassilopoulos, “Algorithms for a class of nondifferentiable problems,” Journal of Optimization Theory and Applications, vol. 34 pp. 41-82, 1981.

    Google Scholar 

  13. O. Pironneau and E. Polak, “On the rate of convergence of certain methods of centers,” Mathematical Programming, vol. 2, pp. 230-258, 1972.

    Google Scholar 

  14. E. Polak, “Basics of minimax algorithms,” in Nonsmooth Optimization and Related Topics, Plenum Press: New York, pp. 343-367, 1989.

    Google Scholar 

  15. E. Polak and L. He, “Rate-preserving discretization strategies for semi-infinite programming and optimal control,” SIAM Journal on Control and Optimization, vol. 30, pp. 548-572, 1992.

    Google Scholar 

  16. E. Polak, “On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems,” Mathematical Programming, vol. 62, pp. 385-414, 1993.

    Google Scholar 

  17. E. Polak, Optimization: Algorithms and Consistent Approximations, Springer: New York, 1997.

    Google Scholar 

  18. L.N. Polyakova, “On the minimization of a quasidifferentiable function subject to equality-type quasidifferentiable constraints,” Mathematical Programming Study, vol. 29, pp. 44-55, 1986.

    Google Scholar 

  19. B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremal Problems, Chislennye Metody v Ekstremal'nykh Zadachakh, Nauka, Moscow, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Polak, E., Qi, L. & Sun, D. First-Order Algorithms for Generalized Semi-Infinite Min-Max Problems. Computational Optimization and Applications 13, 137–161 (1999). https://doi.org/10.1023/A:1008660924636

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008660924636

Navigation