𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A domain decomposition method for optimization problems for partial differential equations

✍ Scribed by M.D. Gunzburger; Jeehyun Lee


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
786 KB
Volume
40
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis


A nonoverlapping domain decomposition method for optimization problems for partial differential equations is presented. The domain decomposition is effected through an auxiliary optimization problem. This results in an multiobjective optimization problem involving the given functional and the auxiliary functional. The existence of an optimal solution to the multiobjective optimization problem is proved as are convergence estimates as the parameters used to regularize the problem (penalty parameters) and to combine the two objective functionals tend to zero. An optimality system for the optimal solution is derived and used to define a gradient method. Convergence results are obtained for the gradient method and the results of some numerical experiments are obtained. Then, unregularized problems having vanishing penalty parameters are discussed. (~ 2000 Elsevier Science Ltd. All rights reserved. Keywords--Optimization problems for partial differential equations, Nonoverlapping domain decomposition methods, Multiobjective optimization.


πŸ“œ SIMILAR VOLUMES


An optimization based domain decompositi
✍ M.D. Gunzburger; J.S. Peterson; H. Kwon πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 906 KB

An optimization-based domain decomposition method for the solution of partial differential equations is presented. The crux of the method is a constrained minimization problem for which the objective functional measures the jump in the dependent variables across the common boundaries between subdoma

Analysis of a nonoverlapping domain deco
✍ J.R. Rice; E.A. Vavalis; Daoqi Yang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 463 KB

In this study we analyze a nonoverlapping domain decomposition method for the solution of elliptic Partial Differential Equation (PDE) problems. This domain decomposition method involves the solution of Dirichlet and Neumann PDE problems on each subdomain, coupled with smoothing operations on the in

A Schwarz domain decomposition method wi
✍ Huibin Chang; Danping Yang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 604 KB

Geometric convergence rate a b s t r a c t A domain decomposition method (DDM) is presented to solve the distributed optimal control problem. The optimal control problem essentially couples an elliptic partial differential equation with respect to the state variable and a variational inequality with

A Domain Decomposition Method for the He
✍ Jean-David Benamou; Bruno DesprΓ¨s πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 504 KB

We present an iterative domain decomposition method to solve the Helmholtz equation and related optimal control problems. The tionally expresses that the control is optimal. This method proof of convergence of this method relies on energy techniques. actually solves at the same time the equations an