Related papers: Constrained optimization in classes of analytic fu…
In this work we present deep learning implementations of two popular theoretical constrained optimization algorithms in infinite dimensional Hilbert spaces, namely, the penalty and the augmented Lagrangian methods. We test these algorithms…
We introduce in this document a direct method allowing to solve numerically inverse type problems for linear hyperbolic equations. We first consider the reconstruction of the full solution of the wave equation posed in $\Omega\times (0,T)$…
In this article we derive Talagrand's $T_2$ inequality on the path space w.r.t. the maximum norm for various stochastic processes, including solutions of one-dimensional stochastic differential equations with measurable drifts, backward…
Statistical applications often involve the calculation of intractable multidimensional integrals. The Laplace formula is widely used to approximate such integrals. However, in high-dimensional or small sample size problems, the shape of the…
We consider the Monge problem of optimal transport between a compactly supported source measure and a target probability measure with unbounded support. We consider the convergence of optimal maps and potential functions when the target…
In limited data computerized tomography, the 2D or 3D problem can be reduced to a family of 1D problems using the differentiated backprojection (DBP) method. Each 1D problem consists of recovering a compactly supported function $f \in…
Convergence rates for $L_2$ approximation in a Hilbert space $H$ are a central theme in numerical analysis. The present work is inspired by Schaback (Math. Comp., 1999), who showed, in the context of best pointwise approximation for radial…
This paper identifies necessary and sufficient conditions for the exactness of penalty functions in optimization problems whose constraint sets are not necessarily bounded. The case where the data of problems is locally Lipschitz,…
Isoperimetric problems consist in minimizing or maximizing a cost functional subject to an integral constraint. In this work, we present two fractional isoperimetric problems where the Lagrangian depends on a combined Caputo derivative of…
We consider optimal interpolation of functions analytic in simply connected domains in the complex plane. By choosing a specific structure for the approximant, we show that the resulting first order optimality conditions can be interpreted…
In this work, we consider an optimal control problem subject to a nonlinear PDE constraint and apply it to the regularized $p$-Laplace equation. To this end, a reduced unconstrained optimization problem in terms of the control variable is…
In this paper, we study linearly constrained optimization problems (LCP). After applying Hadamard parametrization, the feasible set of the parametrized problem (LCPH) becomes an algebraic variety, with conducive geometric properties which…
Optimal approximation and optimal interpolation problems on the classes of periodic functions that are determined by restrictions on several higher derivatives of the functions are solved.
This paper examines the Laplace equation with mixed boundary conditions, the Neumann and Steklov boundary conditions. This models a container with holes in it, like a pond filled with water but partly covered by immovable pieces on the…
In this paper we compute families of reduced order models that match a prescribed set of moments of a highly dimensional linear time-invariant system. First, we fully parametrize the models in the interpolation points and in the free…
A computer-assisted proof is proposed for the Laplacian eigenvalue minimization problems over triangular domains under diameter constraints. The proof utilizes recently developed guaranteed computation methods for both eigenvalues and…
To every nearly convex optimization problem, that is a minimization problem with a nearly convex objective function and a nearly convex constraint set, we associate a uniquely defined convex optimization problem with a lower semicontinuous…
We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…
We investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint…
In recent papers the author introduced a simple alternative to isoparametric finite elements of the n-simplex type, to enhance the accuracy of approximations of second-order boundary value problems with Dirichlet conditions, posed in smooth…