Displaying similar documents to “All-at-once preconditioning in PDE-constrained optimization”

On regularization methods for the numerical solution of parabolic control problems with pointwise state constraints

Ira Neitzel, Fredi Tröltzsch (2009)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this paper we study Lavrentiev-type regularization concepts for linear-quadratic parabolic control problems with pointwise state constraints. In the first part, we apply classical Lavrentiev regularization to a problem with distributed control, whereas in the second part, a Lavrentiev-type regularization method based on the adjoint operator is applied to boundary control problems with state constraints in the whole domain. The analysis for both classes of control problems is investigated...

Mesh-independence and preconditioning for solving parabolic control problems with mixed control-state constraints

Michael Hintermüller, Ian Kopacka, Stefan Volkwein (2009)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

Optimal control problems for the heat equation with pointwise bilateral control-state constraints are considered. A locally superlinearly convergent numerical solution algorithm is proposed and its mesh independence is established. Further, for the efficient numerical solution reduced space and Schur complement based preconditioners are proposed which take into account the active and inactive set structure of the problem. The paper ends by numerical tests illustrating our theoretical...

Control structure in optimization problems of bar systems

Leszek Mikulski (2004)

International Journal of Applied Mathematics and Computer Science

Similarity:

Optimal design problems in mechanics can be mathematically formulated as optimal control tasks. The minimum principle is employed in solving such problems. This principle allows us to write down optimal design problems as Multipoint Boundary Value Problems (MPBVPs). The dimension of MPBVPs is an essential restriction that decides on numerical difficulties. Optimal control theory does not give much information about the control structure, i.e., about the sequence of the forms of the right-hand...

A sensitivity-based extrapolation technique for the numerical solution of state-constrained optimal control problems

Michael Hintermüller, Irwin Yousept (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

Sensitivity analysis (with respect to the regularization parameter) of the solution of a class of regularized state constrained optimal control problems is performed. The theoretical results are then used to establish an extrapolation-based numerical scheme for solving the regularized problem for vanishing regularization parameter. In this context, the extrapolation technique provides excellent initializations along the sequence of reducing regularization parameters. Finally, the favorable...

An SQP trust region method for solving the discrete-time linear quadratic control problem

El-Sayed M.E. Mostafa (2012)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper, a sequential quadratic programming method combined with a trust region globalization strategy is analyzed and studied for solving a certain nonlinear constrained optimization problem with matrix variables. The optimization problem is derived from the infinite-horizon linear quadratic control problem for discrete-time systems when a complete set of state variables is not available. Moreover, a parametrization approach is introduced that does not require starting a feasible...