\`x^2+y_1+z_12^34\`
Advanced Search
Article Contents
Article Contents

A smoothing scheme for optimization problems with Max-Min constraints

Abstract Related Papers Cited by
  • In this paper, we apply a smoothing approach to a minimization problem with a max-min constraint (i.e., a min-max-min problem). More specifically, we first rewrite the min-max-min problem as an optimization problem with several min-constraints and then approximate each min-constraint function by a smooth function. As a result, the original min-max-min optimization problem can be solved by solving a sequence of smooth optimization problems. We investigate the relationship between the global optimal value and optimal solutions of the original min-max-min optimization problem and that of the approximate smooth problem. Under some conditions, we show that the limit points of the first-order (second-order) stationary points of the smooth optimization problems are first-order (second-order) stationary points of the original min-max-min optimization problem.
    Mathematics Subject Classification: Primary: 90C30; Secondary: 90C46, 90C47.

    Citation:

    \begin{equation} \\ \end{equation}
  • 加载中
SHARE

Article Metrics

HTML views() PDF downloads(59) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return