2006
DOI: 10.1137/040602997
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Full Space SQP Lagrange--Newton--Krylov--Schwarz Algorithms for PDE-Constrained Optimization Problems

Abstract: 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-Newton-Krylov-Schwarz (LNKSz) algorithms. In LNKSz, a Lagrangian functional is formed and differentiated to obtain a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
67
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
8
1

Relationship

4
5

Authors

Journals

citations
Cited by 52 publications
(67 citation statements)
references
References 42 publications
0
67
0
Order By: Relevance
“…Leibfritz and Sachs [17] analyze an interior point method that benefits from a reformulation of the quadratic programming subproblems as mixed linear complementarity problems. Our approach has some features in common with the algorithms of Biros and Ghattas [1,2], Haber and Ascher [11], and Prudencio, Byrd and Cai [20] as we follow a full space SQP method and perform a line search to promote convergence. Unlike these papers, however, we present conditions that guarantee the global convergence of inexact SQP steps.…”
mentioning
confidence: 99%
“…Leibfritz and Sachs [17] analyze an interior point method that benefits from a reformulation of the quadratic programming subproblems as mixed linear complementarity problems. Our approach has some features in common with the algorithms of Biros and Ghattas [1,2], Haber and Ascher [11], and Prudencio, Byrd and Cai [20] as we follow a full space SQP method and perform a line search to promote convergence. Unlike these papers, however, we present conditions that guarantee the global convergence of inexact SQP steps.…”
mentioning
confidence: 99%
“…From the necessary condition given in eqn (48), the volume fraction of liquid at each point in space will be iterated, within the constraints, via a fixed-point Newton method shown in eqn (59). (59) A survey of the literature on adjoint-based methods for optimal control [40][41][42][43] gave insight on how to construct a solution algorithm. However, there were no methods specifically for distributed control with free initial and final data and final time for unsteady shock attenuation.…”
Section: Optimal Control Of Shock Wave Attenuation Using Liquid Watermentioning
confidence: 99%
“…As far as we know no one has studied shape optimization problems using Lagrange-Newton-Krylov-Schwarz (LNKSz) method, which has the potential to solve very large problems on machines with a large number of processors. The previous work in [41,42] doesn't consider the change of the computational domain which makes the study much more difficult and interesting.…”
mentioning
confidence: 99%
“…In [12,13], a parallel full space method was introduced for boundary control problems, where a Newton-Krylov method is used together with Schur complement type preconditioners which split the Jacobian system into three sub-systems that are solved one after another. In [41,42], an overlapping Schwarz based Lagrange-Newton-Krylov approach was investigated for some boundary control problems. In these papers, the one-shot approach was shown to be very successful.…”
mentioning
confidence: 99%