Related papers: Subdifferentials and penalty approximations of the…
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…
We present a novel penalty approach for a class of quasi-variational inequalities (QVIs) involving monotone systems and interconnected obstacles. We show that for any given positive switching cost, the solutions of the penalized equations…
We prove the existence and uniqueness of solution of the obstacle problem for quasilinear stochastic partial differential equations (OSPDEs for short) with Neumann boundary condition. Our method is based on the analytical technics coming…
We study a discretization technique for the parabolic fractional obstacle problem in bounded domains. The fractional Laplacian is realized as the Dirichlet-to-Neumann map for a nonuniformly elliptic equation posed on a semi-infinite…
We consider a convex optimization problem with many linear inequality constraints. To deal with a large number of constraints, we provide a penalty reformulation of the problem, where the penalty is a variant of the one-sided Huber loss…
We prove an existence and uniqueness result for quasilinear Stochastic PDEs with obstacle (OSPDE in short). Our method is based on analytical technics coming from the parabolic potential theory. The solution is expressed as a pair $(u,\nu)$…
The framework of differential inclusions encompasses modern optimal control and the calculus of variations. Necessary optimality conditions in the literature identify potentially optimal paths, but do not show how to perturb paths to…
We prove an existence and uniqueness result for two-obstacle problem for quasilinear Stochastic PDEs (DOSPDEs for short). The method is based on the probabilistic interpretation of the solution by using the backward doubly stochastic…
We develop a weak adversarial approach to solving obstacle problems using neural networks. By employing (generalised) regularised gap functions and their properties we rewrite the obstacle problem (which is an elliptic variational…
Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques which is based on Mathematical Programming with…
Variational problems under uniform quasiconvex constraints on the gradient are studied. In particular, existence of solutions to such problems is proved as well as existence of lagrange multipliers associated to the uniform constraint. They…
We consider the steady Navier-Stokes system with mixed boundary conditions, in subdomains of a holdall domain. We study, via the penalization method, its approximation properties. Error estimates, obtained using the extension operator,…
We consider an optimal control problem for the obstacle problem with an elliptic variational inequality. The obstacle function which is the control function is assumed in $H^{2}$. We use an approximate technique to introduce a family of…
The magnetostatic field distribution in a nonlinear medium amounts to the unique minimizer of the magnetic coenergy over all fields that can be generated by the same current. This is a nonlinear saddlepoint problem whose numerical solution…
Recently a number of papers have suggested using neural-networks in order to approximate policy functions in DSGE models, while avoiding the curse of dimensionality, which for example arises when solving many HANK models, and while…
We consider the problem of minimizing a convex function over the intersection of finitely many simple sets which are easy to project onto. This is an important problem arising in various domains such as machine learning. The main difficulty…
We propose a novel penalty method framework for the non-self-adjoint topology optimization problems, taking compliant mechanism problems as an example, by incorporating a convex nonlocal perimeter approximation scheme. We rigorously analyze…
We develop a general equality-constrained nonlinear optimization algorithm based on a smooth penalty function proposed by Fletcher (1970). Although it was historically considered to be computationally prohibitive in practice, we demonstrate…
We consider the P1/P1 or P1b/P1 finite element approximations to the Stokes equations in a bounded smooth domain subject to the slip boundary condition. A penalty method is applied to address the essential boundary condition $u\cdot n = g$…
We study nonlinear parabolic PDEs with Orlicz-type growth conditions. The main result gives the existence of a unique solution to the obstacle problem related to these equations. To achieve this we show the boundedness of weak solutions and…