Journal of Optimization Theory and Applications

, Volume 55, Issue 2, pp 271–287 | Cite as

A direct method of linearization for continuous minimax problems

  • K. C. Kiwiel
Contributed Papers


We consider the problem of minimizing a nondifferentiable function that is the pointwise maximum over a compact family of continuously differentiable functions. We suppose that a certain convex approximation to the objective function can be evaluated. An iterative method is given which uses as successive search directions approximate solutions of semi-infinite quadratic programming problems calculated via a new generalized proximity algorithm. Inexact line searches ensure global convergence of the method to stationary points.

Key Words

Nonlinear programming nondifferentiable optimization minimax problems semi-infinite programming recursive quadratic programming 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Danskin, J. M.,The Theory of Maximin with Applications, SIAM Journal on Applied Mathematics, Vol. 14, pp. 641–655, 1966.Google Scholar
  2. 2.
    Demyanov, V. F., andMalozemov, V. N.,Introduction to Minimax, Wiley, New York, New York, 1977.Google Scholar
  3. 3.
    Fedorov, V. V.,Computational Methods for Maximin, Nauka, Moscow, USSR, 1979 (in Russian).Google Scholar
  4. 4.
    Klessig, R., andPolak, E.,A Method of Feasible Directions Using Function Approximations, with Applications to Minimax Problems, Journal of Mathematical Analysis and Applications, Vol. 41, pp. 583–602, 1973.Google Scholar
  5. 5.
    Chaney, R.,A Method of Centers Algorithm for Certain Minimax Problems, Mathematical Programming, Vol. 22, pp. 202–226, 1982.Google Scholar
  6. 6.
    Blankenship, J. W., andFalk, J. E.,Infinitely Constrained Optimization Problems, Journal of Optimization Theory and Applications, Vol. 19, pp. 261–281, 1976.Google Scholar
  7. 7.
    Gonzaga, C., andPolak, E.,On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximation Algorithms, SIAM Journal on Control and Optimization, Vol. 17, pp. 447–493, 1979.Google Scholar
  8. 8.
    Panin, V. M.,A Method of Linearization for the Continuous Minimax Problem, Kibernetika, No. 2, pp. 75–78, 1981 (in Russian).Google Scholar
  9. 9.
    Polak, E., andWardi, Y.,Nondifferentiable Optimization Algorithm for Designing Control Systems Having Singular-Value Inequalities, Automatica, Vol. 18, pp. 267–283, 1982.Google Scholar
  10. 10.
    Parlett, B. N.,The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, New Jersey, 1980.Google Scholar
  11. 11.
    Kiwiel, K. C.,An Aggregate Subgradient Method for Nonsmooth Convex Minimization, Mathematical Programming, Vol. 27, pp. 320–341, 1983.Google Scholar
  12. 12.
    Klessig, R., andPolak, E.,An Adaptive Precision Gradient Method for Optimal Control, SIAM Journal on Control, Vol. 11, pp. 80–93, 1973.Google Scholar
  13. 13.
    Polak, E.,Computational Methods in Optimization: A Unified Approach, Academic Press, New York, New York, 1971.Google Scholar
  14. 14.
    Wierzbicki, A. P.,Lagrangian Functions and Nondifferentiable Optimization, Progress in Nondifferentiable Optimization, Edited by E. A. Nurminski, International Institute for Applied Systems Analysis, Laxenburg, Austria, Report No. CP-82-S8, pp. 173–213, 1982.Google Scholar
  15. 15.
    Warga, J.,Iterative Procedures for Constrained and Unilateral Optimization Problems, SIAM Journal on Control and Optimization, Vol. 20, pp. 360–376, 1982.Google Scholar
  16. 16.
    Kiwiel, K. C.,A Phase I-Phase II Method for Inequality Constrained Minimax Problems, Control and Cybernetics, Vol. 12, pp. 55–75, 1983.Google Scholar

Copyright information

© Plenum Publishing Corporation 1987

Authors and Affiliations

  • K. C. Kiwiel
    • 1
  1. 1.Systems Research InstitutePolish Academy of SciencesWarsawPoland

Personalised recommendations