An all-at-once approach for the optimal control of the unsteady Burgers equation

Authors:
Fikriye Yılmaz;Bülent Karasözen
Affiliations:
-;-
Venue:
Journal of Computational and Applied Mathematics
Year:
2014

Citing 11
Cited 0

Mesh independence of the gradient projection method for optimal control problems

SIAM Journal on Control and Optimization
Primal-Dual Strategy for Constrained Optimal Control Problems

SIAM Journal on Control and Optimization
Distributed Control Problems for the Burgers Equation

Computational Optimization and Applications
The Primal-Dual Active Set Strategy as a Semismooth Newton Method

SIAM Journal on Optimization
Adjoint concepts for the optimal control of Burgers equation

Computational Optimization and Applications
Mesh-independence of semismooth Newton methods for Lavrentiev-regularized state constrained nonlinear optimal control problems

Numerische Mathematik
Numerical Approximation of Partial Differential Equations

Numerical Approximation of Partial Differential Equations
Optimal Solvers for PDE-Constrained Optimization

SIAM Journal on Scientific Computing
Solving optimal control problems for the unsteady Burgers equation in COMSOL Multiphysics

Journal of Computational and Applied Mathematics
All-at-once solution of time-dependent Stokes control

Journal of Computational Physics
Investigation of Commutative Properties of Discontinuous Galerkin Methods in PDE Constrained Optimal Control Problems

Journal of Scientific Computing

Quantified Score

Hi-index	7.29

Visualization

Abstract

We apply an all-at-once method for the optimal control of the unsteady Burgers equation. The nonlinear Burgers equation is discretized in time using the semi-implicit discretization and the resulting first order optimality conditions are solved iteratively by Newton's method. The discretize then optimize approach is used, because it leads to a symmetric indefinite saddle point problem. Numerical results for the distributed unconstrained and control constrained problems illustrate the performance of the all-at-once approach with semi-implicit time discretization.