Related papers: Optimal $L^p$-approximation of convex sets by conv…
This work studies optimal polynomial approximants (OPAs) in the classical Hardy spaces on the unit disk, $H^p$ ($1 < p < \infty$). For fixed $f\in H^p$ and $n\in\mathbb{N}$, the OPA of degree $n$ associated to $f$ is the polynomial which…
This work proposes an algorithm to bound the minimum distance between points on trajectories of a dynamical system and points on an unsafe set. Prior work on certifying safety of trajectories includes barrier and density methods, which do…
In this paper, we propose a verified numerical method for obtaining a sharp inclusion of the best constant for the embedding $H_{0}^{1}(\Omega) \hookrightarrow L^{p}(\Omega)$ on bounded convex domain in $\mathbb{R}^{2}$. We estimate the…
In this paper we consider the functional \begin{equation*} E_{p,\la}(\Omega):=\int_\Omega \dist^p(x,\pd \Omega )\d x+\la \frac{\H^1(\pd \Omega)}{\H^2(\Omega)}. \end{equation*} Here $p\geq 1$, $\la>0$ are given parameters, the unknown…
This paper is concerned with the numerical minimization of energy functionals in Hilbert spaces involving convex constraints coinciding with a semi-norm for a subspace. The optimization is realized by alternating minimizations of the…
We consider the stochastic optimization problem with smooth but not necessarily convex objectives in the heavy-tailed noise regime, where the stochastic gradient's noise is assumed to have bounded $p$th moment ($p\in(1,2]$). Zhang et al.…
In this paper we consider minimizers of the functional \begin{equation*} \min \big\{ \lambda_1(\Omega)+\cdots+\lambda_k(\Omega) + \Lambda|\Omega|, \ : \ \Omega \subset D \text{ open} \big\} \end{equation*} where $D\subset\mathbb{R}^d$ is a…
Given a bounded convex open set $\Omega\subseteq \mathbb R^N$, we prove that the Poincar\'e-Sobolev constants $\lambda_{p,q}(\Omega)$ can be bounded from below by the $p$-power of the ratio between the perimeter of $\Omega$ and a suitable…
This paper develops and analyzes an accelerated proximal descent method for finding stationary points of nonconvex composite optimization problems. The objective function is of the form $f+h$ where $h$ is a proper closed convex function,…
We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…
In multi-objective optimization, computing the entire non-dominated set (also known as the Pareto front or the Pareto frontier) is often intractable. However, for any multiplicative factor greater than one, an approximation set can be…
In general, standard necessary optimality conditions cannot be formulated in a straightforward manner for semi-smooth shape optimization problems. In this paper, we consider shape optimization problems constrained by variational…
This paper is concerned with a shape optimization problem governed by a non-smooth PDE, i.e., the nonlinearity in the state equation is not necessarily differentiable. We follow the functional variational approach of [40] where the set of…
Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…
The goal of this paper is to address some optimal control and shape optimisation problems arising from bulk-surface cooperative systems. The basic model under consideration is the following: letting $\Omega$ be a fixed domain, we assume…
We study an optimal transport problem in a compact convex set $\Omega\subset\mathbb{R}^d$ where bulk transport is coupled to dynamic optimal transport on a metric graph $ \mathsf{G} = (\mathsf{V},\mathsf{E})$ which is embedded in $\Omega$.…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…
This article introduces a representation of dynamic meshes, adapted to some numerical simulations that require controlling the volume of objects with free boundaries, such as incompressible fluid simulation, some astrophysical simulations…
Optimized Pulse Patterns (OPPs) are gaining increasing popularity in the power electronics community over the well-studied pulse width modulation due to their inherent ability to provide the switching instances that optimize current…
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F such that each point p in P is covered by (contained…