Domain decomposition of optimal control problems for dynamic networks of elastic strings

Journal article
(Original article)


Publication Details

Author(s): Leugering G
Journal: Computational Optimization and Applications
Publisher: Springer Verlag (Germany)
Publication year: 2000
Volume: 16
Journal issue: 1
Pages range: 5-27
ISSN: 0926-6003
Language: English


Abstract


We consider optimal control problems related to exact- and approximate controllability of dynamic networks of elastic strings. In this note we concentrate on problems with linear dynamics, no state and no control constraints. The emphasis is on approximating target states and velocities in part of the network using a dynamic domain decomposition method (d(3)m) for the optimality system on the network. The decomposition is established via a Uzawa-type saddle-point iteration associated with an augmented Lagrangian relaxation of the transmission conditions at multiple joints. We consider various cost functions and prove convergence of the infinite dimensional scheme for an exemplaric choice of the cost. We also give numerical evidence in the case of simple exemplaric networks.



FAU Authors / FAU Editors

Leugering, Günter Prof. Dr.
Lehrstuhl für Angewandte Mathematik


How to cite

APA:
Leugering, G. (2000). Domain decomposition of optimal control problems for dynamic networks of elastic strings. Computational Optimization and Applications, 16(1), 5-27. https://dx.doi.org/10.1023/A:1008721402512

MLA:
Leugering, Günter. "Domain decomposition of optimal control problems for dynamic networks of elastic strings." Computational Optimization and Applications 16.1 (2000): 5-27.

BibTeX: 

Last updated on 2018-28-06 at 05:23