A smoothing scheme for optimization problems with max-min constraints
MetadataShow full item record
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.
The link to the journal’s home page is: http://aimsciences.org/journals/jimo/contents.jsp
Showing items related by title, author, creator and subject.
Li, Bin (2011)In this thesis, we consider several types of optimal control problems with constraints on the state and control variables. These problems have many engineering applications. Our aim is to develop efficient numerical methods ...
Chai, Qinqin (2013)In this thesis, we develop new computational methods for three classes of dynamic optimization problems: (i) A parameter identification problem for a general nonlinear time-delay system; (ii) an optimal control problem ...
Lee, Wei R. (1999)In this thesis we shall investigate the numerical solutions to several important practical static and dynamic optimization problems in engineering and physics. The thesis is organized as follows.In Chapter 1 a general ...