Related papers: Convergence analysis of sectional methods for solv…
We investigate the uniform convergence of subdifferential mappings from empirical risk to population risk in nonsmooth, nonconvex stochastic optimization. This question is key to understanding how empirical stationary points approximate…
In this article, we study the passage of limits from discrete to continuous condensing aggregation equation which comprises of Oort-Hulst-Safronov (OHS) equation together with inverse aggregation process. We establish the relation between…
This paper aims to develop and analyze a numerical scheme for solving the backward problem of semilinear subdiffusion equations. We establish the existence, uniqueness, and conditional stability of the solution to the inverse problem by…
Most high-dimensional estimation and prediction methods propose to minimize a cost function (empirical risk) that is written as a sum of losses associated to each data point. In this paper we focus on the case of non-convex losses, which is…
In this paper, we define new unfitted finite element methods for numerically approximating the solution of surface partial differential equations using bulk finite elements. The key idea is that the $n$-dimensional hypersurface, $\Gamma…
The aim of this paper is to investigate the links between ${\cal T}_C$-class algorithms, CQ Algorithm and shrinking projection methods. We show that strong convergence of these algorithms are related to coherent ${\cal T}_C$-class sequences…
We provide new complexity information for the convergence of the Hybrid Steepest Descent Method for solving the Variational Inequality Problem for a strict contraction on Hilbert space over a closed convex set C given either as the fixed…
We prove strong convergence of a semi-discrete finite difference method for the KdV and modified KdV equations. We extend existing results to non-smooth data (namely, in $L^2$), without size restrictions. Our approach uses a fourth order…
We consider the application of the type-I Anderson acceleration to solving general non-smooth fixed-point problems. By interleaving with safe-guarding steps, and employing a Powell-type regularization and a re-start checking for strong…
We investigate the Cauchy problem for a class of nonlinear elliptic operators with $C^\infty$-coefficients at a regular set $\Omega \subset R^n$. The Cauchy data are given at a manifold $\Gamma \subset \partial\Omega$ and our goal is to…
In this article we develop and analyze novel iterative regularization techniques for the solution of systems of nonlinear ill--posed operator equations. The basic idea consists in considering separately each equation of this system and…
This paper introduces an abstract framework for randomized subspace correction methods for convex optimization, which unifies and generalizes a broad class of existing algorithms, including domain decomposition, multigrid, and block…
This paper deals with the convergence analysis of the SUCPA (Semi Unsupervised Calibration through Prior Adaptation) algorithm, defined from a first-order non-linear difference equations, first developed to correct the scores output by a…
Convex regression is a promising area for bridging statistical estimation and deterministic convex optimization. New piecewise linear convex regression methods are fast and scalable, but can have instability when used to approximate…
Variational inequalities are a universal optimization paradigm that incorporate classical minimization and saddle point problems. Nowadays more and more tasks require to consider stochastic formulations of optimization problems. In this…
The mean shift algorithm is a non-parametric and iterative technique that has been used for finding modes of an estimated probability density function. It has been successfully employed in many applications in specific areas of machine…
The subgradient projection iteration is a classical method for solving a convex inequality. Motivated by works of Polyak and of Crombez, we present and analyze a more general method for finding a fixed point of a cutter, provided that the…
We consider the problem of minimizing the sum of a smooth function $h$ with a bounded Hessian, and a nonsmooth function. We assume that the latter function is a composition of a proper closed function $P$ and a surjective linear map $\cal…
A singularly perturbed linear system of second order partial differential equations of parabolic reaction-diffusion type with given initial and boundary conditions is considered. The leading term of each equation is multiplied by a small…
In this paper we address the convergence of stochastic approximation when the functions to be minimized are not convex and nonsmooth. We show that the "mean-limit" approach to the convergence which leads, for smooth problems, to the ODE…