An Improved Penalty Algorithm using Model Order Reduction for MIPDECO problems with partial observations
Abstract: This work addresses optimal control problems governed by a linear time-dependent partial differential equation (PDE) as well as integer constraints on the control. Moreover, partial observations are assumed in the objective function. The resulting problem poses several numerical challenges due to the mixture of combinatorial aspects, induced by integer variables, and large scale linear algebra issues, arising from the PDE discretization. Since classical solution approaches such as the branch-and-bound framework are typically overwhelmed by such large-scale problems, this work extends an improved penalty algorithm proposed by the authors, to the time-dependent setting. The main contribution is a novel combination of an interior point method, preconditioning, and model order reduction yielding a tailored local optimization solver at the heart of the overall solution procedure. A thorough numerical investigation is carried out both for a Poisson problem as well as a convection-diffusion problem demonstrating the versatility of the approach.
Keywords: mixed integer optimization, PDE-constrained optimization, exact penalty methods, interior point methods, model order reduction
Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )
Category 2: Applications -- Science and Engineering (Optimization of Systems modeled by PDEs )
Citation: D. Garmatter, M. Porcelli, F. Rinaldi, M. Stoll, An Improved Penalty Algorithm using Model Order Reduction for MIPDECO problems with partial observations , pp. 1-27, 2021 (arXiv:2110.03341).
Entry Submitted: 10/09/2021
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|