2,234 research outputs found
Preconditioners for state constrained optimal control problems\ud with Moreau-Yosida penalty function tube
Optimal control problems with partial differential equations play an important role in many applications. The inclusion of bound constraints for the state poses a significant challenge for optimization methods. Our focus here is on the incorporation of the constraints via the Moreau-Yosida regularization technique. This method has been studied recently and has proven to be advantageous compared to other approaches. In this paper we develop preconditioners for the efficient solution of the Newton steps associated with the fast solution of the Moreau-Yosida regularized problem. Numerical results illustrate the competitiveness of this approach. \ud
\ud
Copyright c 2000 John Wiley & Sons, Ltd
All-at-once preconditioning in PDE-constrained optimization
The optimization of functions subject to partial differential equations (PDE) plays an important role in many areas of science and industry. In this paper we introduce the basic concepts of PDE-constrained optimization and show how the all-at-once approach will lead to linear systems in saddle point form. We will discuss implementation details and different boundary conditions. We then show how these system can be solved efficiently and discuss methods and preconditioners also in the case when bound constraints for the control are introduced. Numerical results will illustrate the competitiveness of our techniques
Preconditioners for state constrained optimal control problems with Moreau-Yosida penalty function
Optimal control problems with partial differential equations as constraints play an important role in many applications. The inclusion of bound constraints for the state variable poses a significant challenge for optimization methods. Our focus here is on the incorporation of the constraints via the Moreau-Yosida regularization technique. This method has been studied recently and has proven to be advantageous compared to other approaches. In this paper we develop robust preconditioners for the efficient solution of the Newton steps associated with solving the Moreau-Yosida regularized problem. Numerical results illustrate the efficiency of our approach
Preconditioning for active set and projected gradient methods as\ud semi-smooth Newton methods for PDE-constrained optimization\ud with control constraints
Optimal control problems with partial differential equations play an important role in many applications. The inclusion of bound constraints for the control poses a significant additional challenge for optimization methods. In this paper we propose preconditioners for the saddle point problems that arise when a primal-dual active set method is used. We also show for this method that the same saddle point system can be derived when the method is considered as a semi-smooth Newton method. In addition, the projected gradient method can be employed to solve optimization problems with simple bounds and we discuss the efficient solution of the linear systems in question. In the case when an acceleration technique is employed for the projected gradient method, this again yields a semi-smooth Newton method that is equivalent to the primal-dual active set method. Numerical results illustrate the competitiveness of this approach
FAST SOLUTION METHODS FOR CONVEX QUADRATIC OPTIMIZATION OF FRACTIONAL DIFFERENTIAL EQUATIONS
In this paper, we present numerical methods suitable for solving convex
quadratic Fractional Differential Equation (FDE) constrained optimization
problems, with box constraints on the state and/or control variables. We
develop an Alternating Direction Method of Multipliers (ADMM) framework, which
uses preconditioned Krylov subspace solvers for the resulting sub-problems. The
latter allows us to tackle a range of Partial Differential Equation (PDE)
optimization problems with box constraints, posed on space-time domains, that
were previously out of the reach of state-of-the-art preconditioners. In
particular, by making use of the powerful Generalized Locally Toeplitz (GLT)
sequences theory, we show that any existing GLT structure present in the
problem matrices is preserved by ADMM, and we propose some preconditioning
methodologies that could be used within the solver, to demonstrate the
generality of the approach. Focusing on convex quadratic programs with
time-dependent 2-dimensional FDE constraints, we derive multilevel circulant
preconditioners, which may be embedded within Krylov subspace methods, for
solving the ADMM sub-problems. Discretized versions of FDEs involve large dense
linear systems. In order to overcome this difficulty, we design a recursive
linear algebra, which is based on the Fast Fourier Transform (FFT). We manage
to keep the storage requirements linear, with respect to the grid size ,
while ensuring an order computational complexity per iteration of
the Krylov solver. We implement the proposed method, and demonstrate its
scalability, generality, and efficiency, through a series of experiments over
different setups of the FDE optimization problem
All-at-Once Solution if Time-Dependent PDE-Constrained Optimisation Problems
Time-dependent partial differential equations (PDEs) play an important role in applied mathematics and many other areas of science. One-shot methods try to compute the solution to these problems in a single iteration that solves for all time-steps at the same time. In this paper, we look at one-shot approaches for the optimal control of time-dependent PDEs and focus on the fast solution of these problems. The use of Krylov subspace solvers together with an efficient preconditioner allows for minimal storage requirements. We solve only approximate time-evolutions for both forward and adjoint problem and compute accurate solutions of a given control problem only at convergence of the overall Krylov subspace iteration. We show that our approach can give competitive results for a variety of problem formulations
Preconditioning for Allen-Cahn variational inequalities with non-local constraints
The solution of Allen-Cahn variational inequalities with mass constraints is of interest in many applications. This problem can be solved both in its scalar and vector-valued form as a PDE-constrained optimization problem by means of a primal-dual active set method. At the heart of this method lies the solution of linear systems in saddle point form. In this paper we propose the use of Krylov-subspace solvers and suitable preconditioners for the saddle point systems. Numerical results illustrate the competitiveness of this approach
- …