Article ID: | iaor20131979 |
Volume: | 156 |
Issue: | 3 |
Start Page Number: | 617 |
End Page Number: | 649 |
Publication Date: | Mar 2013 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Barton Paul, Scott Joseph |
Keywords: | programming: convex, programming: nonlinear |
A method is presented for computing convex and concave relaxations of the parametric solutions of nonlinear, semi‐explicit, index‐one differential‐algebraic equations (DAEs). These relaxations are central to the development of a deterministic global optimization algorithm for problems with DAEs embedded. The proposed method uses relaxations of the DAE equations to derive an auxiliary system of DAEs, the solutions of which are proven to provide the desired relaxations. The entire procedure is fully automatable.