Related papers: The Forward Euler Scheme for Nonconvex Lipschitz D…
For initial value problems associated with operator-valued Riccati differential equations posed in the space of Hilbert--Schmidt operators existence of solutions is studied. An existence result known for algebraic Riccati equations is…
Stochastic differential equations are often simulated with the Monte Carlo Euler method. Convergence of this method is well understood in the case of globally Lipschitz continuous coefficients of the stochastic differential equation. The…
Strong convergence results on tamed Euler schemes, which approximate stochastic differential equations with superlinearly growing drift coefficients that are locally one-sided Lipschitz continuous, are presented in this article. The…
An existing solvability result for relaxed one-sided Lipschitz algebraic inclusions is substantially improved. This enhanced solvability result allows the design of a very robust numerical method for the approximation of a solution of the…
This paper addresses the problem of estimating a convex regression function under both the sup-norm risk and the pointwise risk using B-splines. The presence of the convex constraint complicates various issues in asymptotic analysis,…
This paper presents a tractable algorithm for estimating an unknown Lipschitz function from noisy observations and establishes an upper bound on its convergence rate. The approach extends max-affine methods from convex shape-restricted…
We introduce Lipschitz continuous and $C^{1,1}$ geometric approximation and interpolation methods for sampled bounded uniformly continuous functions over compact sets and over complements of bounded open sets in $\mathbb{R}^n$ by using…
In this paper, we present convergence theorems for numerical solutions of the incompressible Euler equations. The first result is the Lax-Wendroff-type theorem, while the second can be formulated in the framework of the Lax equivalence…
Shuffling-type gradient methods are favored in practice for their simplicity and rapid empirical performance. Despite extensive development of convergence guarantees under various assumptions in recent years, most require the Lipschitz…
We show that standard extragradient methods (i.e. mirror prox and dual extrapolation) recover optimal accelerated rates for first-order minimization of smooth convex functions. To obtain this result we provide a fine-grained…
In the article we have obtained some estimates of the rate of convergence for the recently proposed by Yu.E. Nesterov method of minimization of a convex Lipschitz-continuous function of two variables on a square with a fixed side. The…
This paper concerns the study of the generalized Bolza problem governed by differential inclusions satisfying the so-called "relaxed one-sided Lipschitzian" (ROSL) condition with respect to the state variables subject to various types of…
The Euler scheme is one of the standard schemes to obtain numerical approximations of stochastic differential equations (SDEs). Its convergence properties are well-known in the case of globally Lipschitz continuous coefficients. However, in…
We consider the problem of the approximation of the solution of a one-dimensional SDE with non-globally Lipschitz drift and diffusion coefficients behaving as $x^\alpha$, with $\alpha>1$. We propose an (semi-explicit) exponential-Euler…
First-order optimization methods are crucial for solving large-scale data processing problems, particularly those involving convex non-smooth composite objectives. For such problems with convex non-smooth composite objectives, we introduce…
This paper analyzes the convergence rates of the {\it Frank-Wolfe } method for solving convex constrained multiobjective optimization. We establish improved convergence rates under different assumptions on the objective function, the…
We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity…
Evolution strategy (ES) is one of the promising classes of algorithms for black-box continuous optimization. Despite its broad successes in applications, theoretical analysis on the speed of its convergence is limited on convex quadratic…
We perform the first tight convergence analysis of the gradient method with varying step sizes when applied to smooth hypoconvex (weakly convex) functions. Hypoconvex functions are smooth nonconvex functions whose curvature is bounded and…
We investigate the convergence properties of exact and inexact forward-backward algorithms to minimise the sum of two weakly convex functions defined on a Hilbert space, where one has a Lipschitz-continuous gradient. We show that the exact…