Related papers: A trust region reduced basis Pascoletti-Serafini a…
Many nonlinear differential equations arising from practical problems may permit nontrivial multiple solutions relevant to applications, and these multiple solutions are helpful to deeply understand these practical problems and to improve…
Manifold optimization has recently gained significant attention due to its wide range of applications in various areas. This paper introduces the first Riemannian trust region method for minimizing an SC$^1$ function, which is a…
We present a class of reduced basis (RB) methods for the iterative solution of parametrized symmetric positive-definite (SPD) linear systems. The essential ingredients are a Galerkin projection of the underlying parametrized system onto a…
In this contribution, we introduce and numerically evaluate a certified and adaptive localized reduced basis method as a local model in a trust-region optimization method for parameter optimization constrained by partial differential…
In this work, we propose to efficiently solve time dependent parametrized optimal control problems governed by parabolic partial differential equations through the certified reduced basis method. In particular, we will exploit an error…
Many inverse and parameter estimation problems can be written as PDE-constrained optimization problems. The goal, then, is to infer the parameters, typically coefficients of the PDE, from partial measurements of the solutions of the PDE for…
A methodology grounded in model reduction is presented for accelerating the gradient-based solution of a family of linear or nonlinear constrained optimization problems where the constraints include at least one linear Partial Differential…
The $p$-regularized subproblem (p-RS) is a regularisation technique in computing a Newton-like step for unconstrained optimization, which globally minimizes a local quadratic approximation of the objective function while incorporating with…
The trust-region problem, which minimizes a nonconvex quadratic function over a ball, is a key subproblem in trust-region methods for solving nonlinear optimization problems. It enjoys many attractive properties such as an exact…
We present a unified approach for characterizing the boundary of a possibly nonconvex domain. Motivated by the well-known Pascoletti--Serafini method of scalarization, we recast the boundary characterization as a multi-criteria optimization…
In this paper, we study numerically the linear damped second-order hyperbolic partial differential equation (PDE) with affine parameter dependence using a goal-oriented approach by finite element (FE) and reduced basis (RB) methods. The…
Optimization problems constrained by partial differential equations (PDEs) naturally arise in scientific computing, as those constraints often model physical systems or the simulation thereof. In an implicitly constrained approach, the…
Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and…
In this paper, we propose a model reduction method for solving multiscale elliptic PDEs with random coefficients in the multiquery setting using an optimization approach. The optimization approach enables us to construct a set of localized…
Computational approaches to PDE-constrained optimization under uncertainty may involve finite-dimensional approximations of control and state spaces, sample average approximations of measures of risk and reliability, smooth approximations…
This paper proposes a random subspace trust-region algorithm for general convex-constrained derivative-free optimization (DFO) problems. Similar to previous random subspace DFO methods, the convergence of our algorithm requires a certain…
We investigate a trust-region algorithm to solve a nonconvex optimization problem with $L^p$-regularization for $p\in(0,1)$. The algorithm relies on descent properties of a so-called generalized Cauchy point that can be obtained efficiently…
In this paper, we employ a reduced basis method for solving the PDE constrained optimization problem governed by a fractional parabolic equation with the fractional derivative in time from order beta in (0,1) is defined by Caputo fractional…
PDE-constrained optimization problems arise in a broad number of applications such as hyperthermia cancer treatment or blood flow simulation. Discretization of the optimization problem and using a Lagrangian approach result in a large-scale…
The estimation of distributed parameters in partial differential equations (PDE) from measures of the solution of the PDE may lead to under-determination problems. The choice of a parameterization is a usual way of adding a-priori…