Lagrange { Sqp { Newton Method for the Control of a Phase Field Equation
نویسنده
چکیده
This paper investigates the local convergence of the Lagrange{SQP{Newton method applied to an optimal control problem governed by a phase eld equation with distributed control. The phase eld equation is a system of two semilinear parabolic diierential equations. Stability analysis of optimization problems and regularity results for parabolic diierential equations are used to proof convergence of the controls with respect to the L 2 (Q) norm and with respect to the L 1 (Q) norm.
منابع مشابه
Analysis of the Lagrange–SQP–Newton Method for the Control of a Phase Field Equation
This paper investigates the local convergence of the Lagrange–SQP–Newton method applied to an optimal control problem governed by a phase field equation with distributed control. The phase field equation is a system of two semilinear parabolic differential equations. Stability analysis of optimization problems and regularity results for parabolic differential equations are used to proof converg...
متن کاملOn the Lagrange--Newton--SQP Method for the Optimal Control of Semilinear Parabolic Equations
A class of Lagrange-Newton-SQP methods is investigated for optimal control problems governed by semilinear parabolic initial-boundary value problems. Distributed and boundary controls are given, restricted by pointwise upper and lower bounds. The convergence of the method is discussed in appropriate Banach spaces. Based on a weak second order suucient optimality condition for the reference solu...
متن کاملParallel Lagrange-Newton-Krylov-Schur Methods for PDE-Constrained Optimization. Part I: The Krylov-Schur Solver
Large scale optimization of systems governed by partial differential equations (PDEs) is a frontier problem in scientific computation. The state-of-the-art for such problems is reduced quasi-Newton sequential quadratic programming (SQP) methods. These methods take full advantage of existing PDE solver technology and parallelize well. However, their algorithmic scalability is questionable; for c...
متن کاملParallel Full Space SQP Lagrange-Newton-Krylov-Schwarz Algorithms for PDE-Constrained Optimization Problems
Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for the parallel numerical solution of such problems involve sequential quadratic programming (SQP), with either reduced or full space approaches. In this paper we propose and investigate a class of parallel full space SQP Lagrange...
متن کاملParallel Lagrange-Newton-Krylov-Schur Methods for PDE-Constrained Optimization. Part II: The Lagrange-Newton Solver and Its Application to Optimal Control of Steady Viscous Flows
In part I of this article, we proposed a Lagrange–Newton–Krylov–Schur (LNKS) method for the solution of optimization problems that are constrained by partial differential equations. LNKS uses Krylov iterations to solve the linearized Karush–Kuhn–Tucker system of optimality conditions in the full space of states, adjoints, and decision variables, but invokes a preconditioner inspired by reduced ...
متن کامل