A penalty approach to a discretized double obstacle problem with derivative constraints
MetadataShow full item record
© 2014, Springer Science+Business Media New York. This work presents a penalty approach to a nonlinear optimization problem with linear box constraints arising from the discretization of an infinite-dimensional differential obstacle problem with bound constraints on derivatives. In this approach, we first propose a penalty equation approximating the mixed nonlinear complementarity problem representing the Karush–Kuhn–Tucker conditions of the optimization problem. We then show that the solution to the penalty equation converges to that of the complementarity problem with an exponential convergence rate depending on the parameters used in the equation. Numerical experiments, carried out on a non-trivial test problem to verify the theoretical finding, show that the computed rates of convergence match the theoretical ones well.
Showing items related by title, author, creator and subject.
Yu, Changjun (2012)In this thesis, We propose new computational algorithms and methods for solving four classes of constrained optimization and optimal control problems. In Chapter 1, we present a brief review on optimization and ...
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 ...
Loxton, Ryan Christopher (2010)In this thesis, we develop numerical methods for solving five nonstandard optimal control problems. The main idea of each method is to reformulate the optimal control problem as, or approximate it by, a nonlinear programming ...