Related papers: Convex Functions in ACL2(r)
This note concerns the relationship between conditions on cost functions and domains and the convexity properties of potentials in optimal transportation and the continuity of the associated optimal mappings. In particular, we prove that if…
We develop multi-step gradient methods for network-constrained optimization of strongly convex functions with Lipschitz-continuous gradients. Given the topology of the underlying network and bounds on the Hessian of the objective function,…
The aim of this paper is to present a detailed and slightly modified version of the proof of the Lempert Theorem in the case of non-planar stronlgy linearly convex domains with C^2 smooth boundaries. The original Lempert's proof is…
We construct a Lipschitz function on $\er^{2}$ which is locally convex on the complement of some totally disconnected compact set but not convex. Existence of such function disproves a theorem that appeared in a paper by L. Pasqualini and…
Non-convex optimization plays a key role in a growing number of machine learning applications. This motivates the identification of specialized structure that enables sharper theoretical analysis. One such identified structure is…
We consider the problems of \emph{learning} and \emph{testing} real-valued convex functions over Gaussian space. Despite the extensive study of function convexity across mathematics, statistics, and computer science, its learnability and…
The aim of this paper is to develop an efficient algorithm for solving a class of unconstrained nondifferentiable convex optimization problems in finite dimensional spaces. To this end we formulate first its Fenchel dual problem and…
We demonstrate that the Cartan-Thullen theorem and its generalisation to the context of generalised convexity, which we establish herein, can be regarded as consequences of the classical theorems of functional analysis: the Banach-Steinhaus…
Barrier methods play a central role in the theory and practice of convex optimization. One of the most general and successful analyses of barrier methods for convex optimization, due to Nesterov and Nemirovskii, relies on the notion of…
We propose a stochastic optimization method for the minimization of the sum of three convex functions, one of which has Lipschitz continuous gradient as well as restricted strong convexity. Our approach is most suitable in the setting where…
The notion of a valuation on convex bodies is very classical. The notion of a valuation on a class of functions was recently introduced and studied by M. Ludwig and others. We study an explicit relation between continuous valuations on…
In this paper, we develop a unified framework able to certify both exponential and subexponential convergence rates for a wide range of iterative first-order optimization algorithms. To this end, we construct a family of parameter-dependent…
A framework is presented whereby a general convex conic optimization problem is transformed into an equivalent convex optimization problem whose only constraints are linear equations and whose objective function is Lipschitz continuous.…
In this article we describe the solutions of three problems posed at different time by Yurii Nesterov. First problem is 'Mage vs Experts': Assume that we live in some enviroment that characterized by unobservable convex function $f(x)$.…
We provide a unified framework for a systematic analysis of the existence of solutions to general nonconvex problems, relying on asymptotic and retractive cones for functions and sets. Using this framework we develop new necessary and…
We formalize some basic properties of Fourier series in the logic of ACL2(r), which is a variant of ACL2 that supports reasoning about the real and complex numbers by way of non-standard analysis. More specifically, we extend a framework…
This is the first part of our work on Zariski decomposition structures, where we study Zariski decompositions using Legendre-Fenchel type transforms. In this way we define a Zariski decomposition for curve classes. This decomposition…
Even though the ACL2 logic is first order, the ACL2 system offers several mechanisms providing users with some operations akin to higher order logic ones. In this paper, we propose a macro, named instance-of-defspec, to ease the reuse of…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
It is proved the generalization of Toponogov theorem about the length of the curve in two-dimensional Riemannian manifolds in the case of two-dimensional Alexandrov spaces.