A smoothing-out technique for min-max optimization

Research output: Contribution to journalArticlepeer-review


In this paper, we suggest approximations for smoothing out the kinks caused by the presence of "max" or "min" operators in many non-smooth optimization problems. We concentrate on the continuous-discrete min-max optimization problem. The new approximations replace the original problem in some neighborhoods of the kink points. These neighborhoods can be made arbitrarily small, thus leaving the original objective function unchanged at almost every point of Rn. Furthermore, the maximal possible difference between the optimal values of the approximate problem and the original one, is determined a priori by fixing the value of a single parameter. The approximations introduced preserve properties such as convexity and continuous differentiability provided that each function composing the original problem has the same properties. This enables the use of efficient gradient techniques in the solution process. Some numerical examples are presented.

Original languageEnglish
Pages (from-to)61-77
Number of pages17
JournalMathematical Programming
Issue number1
StatePublished - Dec 1980


  • Min-Max Problems
  • Nondifferentiable Optimization
  • Nonlinear Programming
  • Optimization
  • Unconstrained Optimization


Dive into the research topics of 'A smoothing-out technique for min-max optimization'. Together they form a unique fingerprint.

Cite this