Related papers: Sublinear Scalarizations for Proper and Approximat…
In this paper we look at a particular problem related to under-determined linear systems of equations with sparse solutions. $\ell_1$-minimization is a fairly successful polynomial technique that can in certain statistical scenarios find…
We consider a general multi-agent convex optimization problem where the agents are to collectively minimize a global objective function subject to a global inequality constraint, a global equality constraint, and a global constraint set.…
In this paper we study the right differentiability of a parametric infimum function over a parametric set defined by equality constraints. We present a new theorem with sufficient conditions for the right differentiability with respect to…
Rayleigh quotient minimization deals with optimizing a quadratic homogeneous function over a sphere. Its critical points correspond to the normalized eigenvectors of the symmetric matrix associated with the quadratic form. In this paper, we…
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum…
Locating proximal points is a component of numerous minimization algorithms. This work focuses on developing a method to find the proximal point of a convex function at a point, given an inexact oracle. Our method assumes that exact…
We study a simple model of unsupervised learning where the single symmetry breaking vector has binary components $\pm 1$. We calculate exactly the Bayes-optimal performance of an estimator which is required to lie in the same discrete…
We study the local approximation properties in hierarchical spline spaces through multiscale quasi-interpolation operators. This construction suggests the analysis of a subspace of the classical hierarchical spline space (Vuong et al.,…
This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an…
We consider convex and nonconvex constrained optimization with a partially separable objective function: agents minimize the sum of local objective functions, each of which is known only by the associated agent and depends on the variables…
We consider the minimization of submodular functions subject to ordering constraints. We show that this optimization problem can be cast as a convex optimization problem on a space of uni-dimensional measures, with ordering constraints…
In this paper, we study some optimization problems in uniformly convex and uniformly smooth Bochner spaces. We consider four cases of the underlying subsets: closed and convex subsets, closed and convex cones, closed subspaces and closed…
It is well-known that accelerated gradient first-order methods possess optimal complexity estimates for the class of convex smooth minimization problems. In many practical situations it makes sense to work with inexact gradient information.…
Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…
We consider the approximate minimization of a given polynomial on the standard simplex, obtained by taking the minimum value over all rational grid points with given denominator ${r} \in \mathbb{N}$. It was shown in [De Klerk, E., Laurent,…
Recovering nonlinearly degraded signal in the presence of noise is a challenging problem. In this work, this problem is tackled by minimizing the sum of a non convex least-squares fit criterion and a penalty term. We assume that the…
We present a general procedure to construct examples of convex scalar variational problems which admit a minimizers with large singular sets. The dimension of the set of singularities is maximal and the minimizer has no higher integrability…
Optimization problems under affine constraints appear in various areas of machine learning. We consider the task of minimizing a smooth strongly convex function F(x) under the affine constraint Kx=b, with an oracle providing evaluations of…
Two commonly arising computational tasks in Bayesian learning are Optimization (Maximum A Posteriori estimation) and Sampling (from the posterior distribution). In the convex case these two problems are efficiently reducible to each other.…
Let $X$ be a finite-dimensional normed space and let $Y \subseteq X$ be its proper linear subspace. The set of all minimal projections from $X$ to $Y$ is a convex subset of the space all linear operators from $X$ to $X$ and we can consider…