Related papers: Erd\H{o}s' minimum overlap problem
We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…
We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…
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 give an exposition of some connections between Fourier optimization problems and problems in number theory. In particular, we present some recent conditional bounds under the generalized Riemann hypothesis, achieved via a Fourier…
We study a problem of minimal surfaces with free boundary written in the form of a non convex minimization problem. Our aim is to characterize optimal solutions by finding a suitable calibration field. A natural upper bound of the infimum…
This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs…
The aim of this paper is to present an original approach that takes advantage from the geometric features of strictly convex functions to tackle the problem of finding the minimum from another perspective. The general idea is that near the…
In this paper we analyze the extension of the classical smallest enclosing disk problem to the case of the location of a polyellipsoid to fully cover a set of demand points in $\mathbb{R}^d$. We prove that the problem is polynomially…
We advocate an optimization procedure for variable density sampling in the context of compressed sensing. In this perspective, we introduce a minimization problem for the coherence between the sparsity and sensing bases, whose solution…
Mixed-integer mathematical programs are among the most commonly used models for a wide set of problems in Operations Research and related fields. However, there is still very little known about what can be expressed by small mixed-integer…
In this paper, we consider the problem of minimizing the sum of two convex functions subject to linear linking constraints. The classical alternating direction type methods usually assume that the two convex functions have relatively easy…
Lowpass envelope approximation of smooth continuous-variable signals are introduced in this work. Envelope approximations are necessary when a given signal has to be approximated always to a larger value (such as in TV white space…
We study the Erd\"os/Falconer distance problem in vector spaces over finite fields. Let ${\Bbb F}_q$ be a finite field with $q$ elements and take $E \subset {\Bbb F}^d_q$, $d \ge 2$. We develop a Fourier analytic machinery, analogous to…
This paper presents a novel hybrid algorithm for minimizing the sum of a continuously differentiable loss function and a nonsmooth, possibly nonconvex, sparse regularization function. The proposed method alternates between solving a…
The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…
The minimum modulus problem on covering systems was posed by Erd\H{o}s in 1950, who asked whether the minimum modulus of a covering system with distinct moduli is bounded. In 2007, Filaseta, Ford, Konyagin, Pomerance and Yu affirmed it if…
Define a forward problem as $\rho_y = G_\#\rho_x$, where the probability distribution $\rho_x$ is mapped to another distribution $\rho_y$ using the forward operator $G$. In this work, we investigate the corresponding inverse problem: Given…
This paper exploit the equivalence between the Schr\"odinger Bridge problem and the entropy penalized optimal transport in order to find a different approach to the duality, in the spirit of optimal transport. This approach results in a…
We present a powerful and easy-to-implement algorithm for solving constrained optimization problems that involve $L_1$/total-variation regularization terms, and both equality and inequality constraints. We discuss the relationship of our…
This paper investigates a general class of problems in which a lower bounded smooth convex function incorporating $\ell_{0}$ and $\ell_{2,0}$ regularization is minimized over a box constraint. Although such problems arise frequently in…