A two-level decomposition-aggregation approach for large-scale optimal control problems (Q1903655): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Stability of solutions to control constrained nonlinear optimal control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange Duality Theory for Convex Control Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative aggregation method for constrained optimal control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of optimization problems in Hilbert space with application to optimal control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5653816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4174571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition procedure for one class of block programming problems / rank
 
Normal rank

Latest revision as of 08:48, 24 May 2024

scientific article
Language Label Description Also known as
English
A two-level decomposition-aggregation approach for large-scale optimal control problems
scientific article

    Statements

    A two-level decomposition-aggregation approach for large-scale optimal control problems (English)
    0 references
    12 December 1995
    0 references
    A new approach is proposed for the solution of large-scale constrained optimal control problems governed by ordinary differential equations. The method is intended for problems where the main difficulty is the large number of controls and hard control constraints. A typical example of such a system is a dynamical resource allocation problem. The method is based on aggregation-disaggregation ideas and is within the class of feasible decomposition methods. The aggregation is applied to the controls. It is shown that the problem of updating the disaggregation in each iteration decomposes into independent subproblems of lower dimension. If the original problem has block- or block-separable structure, then the subproblems are formulated according to the blocks. Numerical examples to illustrate the method are given.
    0 references
    0 references
    0 references
    0 references
    0 references
    numerical examples
    0 references
    large-scale constrained optimal control problems
    0 references
    dynamical resource allocation problem
    0 references
    feasible decomposition methods
    0 references
    aggregation
    0 references
    updating
    0 references
    disaggregation
    0 references
    iteration
    0 references
    0 references
    0 references