A new exact penalty function approach to semi-infinite programming problem
MetadataShow full item record
In this paper, we propose a new exact penalty function method for solving a class of semi-infinite programming problems (SIPs). We introduce a logarithmic form function of the constraint violation, where the constraint violation is a measure of the violation of the constraints of the current iterate. By appending it to the objective function, we obtain a sequence of approximate conventional unconstrained optimization problem. It is proved that when the penalty parameter is sufficiently large, any local minimizer of the approximate problem is a local minimizer of the original problem. Numerical results show that the proposed method is effective.
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 ...
Chong, Yen N. (2001)General routing problems deal with transporting some commodities and/or travelling along the axes of a given network in some optimal manner. In the modern world such problems arise in several contexts such as distribution ...