A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems
نویسندگان
چکیده
منابع مشابه
Constrained Programming for Optimization Problems in PDE
Optimization problems in PDE models are often approached by considering the PDE model as a black-box input-output relation and thus solving an unconstrained optimization problem. In contrast to that, considering the PDE model as a side condition of a resulting constrained programming problem enables us to simultaneously solve the PDE model equations together with the optimization problem. This ...
متن کاملModel Problems in PDE-Constrained Optimization
This work aims to aid in introducing, experimenting and benchmarking algorithms for PDE-constrained optimization problems by presenting a set of such model problems. We specifically examine a type of PDE-constrained optimization problem, the parameter estimation problem. We present three model parameter estimation problems, each containing a different type of partial differential equation as th...
متن کاملA multilevel algorithm for inverse problems with elliptic PDE constraints
We present a multilevel algorithm for the solution of a source identification problem in which the forward problem is an elliptic partial differential equation on the 2D unit box. The Hessian corresponds to a Tikhonov-regularized first-kind Fredholm equation. Our method uses an approximate Hessian operator for which, first, the spectral decomposition is known, and second, there exists a fast al...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملConstrained Multi-Objective Optimization Problems in Mechanical Engineering Design Using Bees Algorithm
Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using classical optimization methods, this paper presents a Multi-Objective Bees Algorithm (MOBA) for solving the multi-objective optimal of mechanical engineering problems design. In the pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational and Applied Mathematics
سال: 2020
ISSN: 2238-3603,1807-0302
DOI: 10.1007/s40314-020-01379-1