A Novel Penalty Approach for Nonlinear Dynamic Optimization Problems With Inequality Path Constraints

Abstract

The control vector parameterization (CVP) approach is popular to solve nonlinear dynamic optimization problems, but handling inequality path constraints within its framework is a challenge. This study deals with inequality path constraints by using the l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> penalty function and a novel smoothing technique. After clarifying some theories of the proposed approach, a concomitant algorithm is also put forward and verified.