Related papers: A Robbins-Monro type algorithm for computing globa…
Grover's algorithm can be employed in global optimization methods providing, in some cases, a quadratic speedup over classical algorithms. This paper describes a new method for continuous global optimization problems that uses a classical…
In this article, we prove that convex functions and log-convex functions obey certain general refinements that lead to several refinements and reverses of well known inequalities for matrices, including Young's inequality, Heinz inequality,…
In this paper we propose a modified version of the simulated annealing algorithm for solving a stochastic global optimization problem. More precisely, we address the problem of finding a global minimizer of a function with noisy…
This paper explores the performance of a random Gaussian smoothing zeroth-order (ZO) scheme for minimising quasar-convex (QC) and strongly quasar-convex (SQC) functions in both unconstrained and constrained settings. For the unconstrained…
Finding the minimum and the minimizers of convex functions has been of primary concern in convex analysis since its conception. It is well-known that if a convex function has a minimum, then that minimum is global. The minimizers, however,…
Let $U\subseteq\mathbb{R}^{n}$ be open and convex. We show that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we…
We introduce a generalized forward-backward splitting method with penalty term for solving monotone inclusion problems involving the sum of a finite number of maximally monotone operators and the normal cone to the nonempty set of zeros of…
Motivated by recent increased interest in optimization algorithms for non-convex optimization in application to training deep neural networks and other optimization problems in data analysis, we give an overview of recent theoretical…
In this article we present and analyse new multilevel adaptations of stochastic approximation algorithms for the computation of a zero of a function $f\colon D \to \mathbb R^d$ defined on a convex domain $D\subset \mathbb R^d$, which is…
We consider a composite optimization problem where the sum of a continuously differentiable and a merely lower semicontinuous function has to be minimized. The proximal gradient algorithm is the classical method for solving such a problem…
We consider summability methods generated by the class GM(2b). We generalize some related results of P. Pych-Taberska [Studia Math. XCVI (1990), 91-103] on strong approximation of almost periodic functions by their Fourier series and S. M.…
In this note we revisit a less known symmetrization method for functions with respect to a topological group $G$, which we call $G$-averaging. We note that, although quite non-technical in nature, this method yields $G$-invariant minimizers…
In stochastic optimization, the population risk is generally approximated by the empirical risk. However, in the large-scale setting, minimization of the empirical risk may be computationally restrictive. In this paper, we design an…
Some sharp results related to the convergence of means and families of operators generated by the generalized Bochner-Riesz kernels are obtained. The exact order of approximation of functions by these methods via $K$-functional (or its…
In certain classes of subharmonic functions u on C distinguished in terms of lower bounds for the Riesz measure of u, a sharp estimate is obtained for the rate of approximation by functions of the form log |f(z)|, where f is an entire…
We give a generalisation of the Lenstra-Lenstra-Lov\'asz (LLL) lattice-reduction algorithm that is valid for an arbitrary (split, semisimple) reductive group $G$. This can be regarded as `lattice reduction with symmetries'. We make this…
We give quantum speedups of several general-purpose numerical optimisation methods for minimising a function $f:\mathbb{R}^n \to \mathbb{R}$. First, we show that many techniques for global optimisation under a Lipschitz constraint can be…
The purpose of this text is to provide an accessible introduction to a set of recently developed algorithms for factorizing matrices. These new algorithms attain high practical speed by reducing the dimensionality of intermediate…
We consider positive, integral-preserving linear operators acting on $L^1$ space, known as stochastic operators or Markov operators. We show that, on finite-dimensional spaces, any stochastic operator can be approximated by a sequence of…
Classical results show that gradient descent converges linearly to minimizers of smooth strongly convex functions. A natural question is whether there exists a locally nearly linearly convergent method for nonsmooth functions with quadratic…