Related papers: Optimal $L^p$-approximation of convex sets by conv…
In this paper, we study the problem of escaping from saddle points in smooth nonconvex optimization problems subject to a convex set $\mathcal{C}$. We propose a generic framework that yields convergence to a second-order stationary point of…
Witsenhausen's problem asks for the maximum fraction $\alpha_n$ of the $n$-dimensional unit sphere that can be covered by a measurable set containing no pairs of orthogonal points. The best upper bounds for $\alpha_n$ are given by…
For a given domain $\Omega \subset \Bbb{R}^n$, we consider the variational problem of minimizing the $L^1$-norm of the gradient on $\Omega$ of a function $u$ with prescribed continuous boundary values and satisfying a continuous lower…
This article revolves around shape and topology optimization, in the applicative context where the objective and constraint functionals depend on the solution to a physical boundary value problem posed on the optimized domain. We introduce…
In this paper, we propose a new algorithm to speed-up the convergence of accelerated proximal gradient (APG) methods. In order to minimize a convex function $f(\mathbf{x})$, our algorithm introduces a simple line search step after each…
This paper considers stochastic convex optimization problems with smooth functional constraints arising in constrained estimation and robust signal recovery. We operate in the high-dimensional and highly-constrained setting, where oracle…
It is shown that solutions to the anisotropic least gradient problem for boundary data $f \in L^p(\partial\Omega)$ lie in $L^{\frac{Np}{N-1}}(\Omega)$; the exponent is shown to be optimal. Moreover, the solutions are shown to be locally…
The aperture angle alpha(x, Q) of a point x not in Q in the plane with respect to a convex polygon Q is the angle of the smallest cone with apex x that contains Q. The aperture angle approximation error of a compact convex set C in the…
This article deals with a particular class of shape and topology optimization problems: the optimized design is a region $G$ of the boundary $\partial \Omega$ of a given domain $\Omega$, which supports a particular type of boundary…
The problem of low-rank approximation with convex constraints, which appears in data analysis, system identification, model order reduction, low-order controller design and low-complexity modelling is considered. Given a matrix, the…
Motivated, in particular, by the entropy-regularized optimal transport problem, we consider convex optimization problems with linear equality constraints, where the dual objective has Lipschitz $p$-th order derivatives, and develop two…
Minimizing the number of probes is one of the main challenges in reconstructing geometric objects with probing devices. In this paper, we investigate the problem of using an $\omega$-wedge probing tool to determine the exact shape and…
In this paper we consider convex optimization problems with stochastic composite objective function subject to (possibly) infinite intersection of constraints. The objective function is expressed in terms of expectation operator over a sum…
Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…
In Euclidean space, it is well known that any integration by parts formula for a set of finite perimeter $\Omega$ is expressed by the integration with respect to a measure $P(\Omega,\cdot)$ which is equivalent to the one-codimensional…
We establish a $\Gamma$-convergence result for $h\to 0$ of a thin nonlinearly elastic 3D-plate of thickness $h>0$ which is assumed to be glued to a support region in the 2D-plane $x_3=0$ over the $h$-2D-neighborhood of a given closed set…
This paper is devoted to the analysis of a second order method for recovering the \emph{a priori} unknown shape of an inclusion $\omega$ inside a body $\Omega$ from boundary measurement. This inverse problem - known as electrical impedance…
In the Upper Degree-Constrained Partial Orientation problem we are given an undirected graph $G=(V,E)$, together with two degree constraint functions $d^-,d^+ : V \to \mathbb{N}$. The goal is to orient as many edges as possible, in such a…
In this manuscript we study the following optimization problem: given a bounded and regular domain $\Omega\subset \mathbb{R}^N$ we look for an optimal shape for the "$\mathrm{W}-$vanishing window" on the boundary with prescribed measure…
We present a general technique for the analysis of first-order methods. The technique relies on the construction of a duality gap for an appropriate approximation of the objective function, where the function approximation improves as the…