Domain decomposition of optimal control problems for dynamic networks of elastic strings (Q1578499): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1008721402512 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1892993714 / rank
 
Normal rank

Latest revision as of 10:54, 30 July 2024

scientific article
Language Label Description Also known as
English
Domain decomposition of optimal control problems for dynamic networks of elastic strings
scientific article

    Statements

    Domain decomposition of optimal control problems for dynamic networks of elastic strings (English)
    0 references
    3 April 2001
    0 references
    The purpose of this very important paper is to study the optimal control problems related to exact and approximate controllability of dynamic networks of elastic strings. This paper is devoted to the 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 decomposition method \((d^3m)\) for the optimality system of the network. Main result: The decomposition is established via an Uzawa-type saddle-point iteration associated with an augmented Lagrangian relaxation of the transmission conditions at multiple joints. The author considers various cost functions and proves convergence of the infinite-dimensional scheme for an exemplary choice of the cost. Finally, the numerical evidence in the case of simple exemplary network is given.
    0 references
    dynamic networks of elastic strings
    0 references
    dynamic domain decomposition
    0 references
    optimal control
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references