Related papers: Variational regularization with oversmoothing pena…
Proximal gradient methods are a popular tool for the solution of structured, nonsmooth minimization problems. In this work, we investigate an extension of the former to general Banach spaces and provide worst-case convergence rates for,…
We develop a semismooth Newton framework for the numerical solution of fixed-point equations that are posed in Banach spaces. The framework is motivated by applications in the field of obstacle-type quasi-variational inequalities and…
We introduce subgradient-based Lavrentiev regularisation of the form \begin{equation*} \mathcal{A}(u) + \alpha \partial \mathcal{R}(u) \ni f^\delta \end{equation*} for linear and nonlinear ill-posed problems with monotone operators…
A nonlinear equation in a Banach space is written as a linear equation with a linear operator depending on the unknown solution. This method, which we call a global linearization method, differs essentially from the local linearization…
Despite the strong focus of regularization on ill-posed problems, the general construction of such methods has not been fully explored. Moreover, many previous studies cannot be clearly adapted to handle more complex scenarios, albeit the…
To solve convex optimization problems with a noisy gradient input, we analyze the global behavior of subgradient-like flows under stochastic errors. The objective function is composite, being equal to the sum of two convex functions, one…
In this paper, we propose a coupled tensor norm regularization that could enable the model output feature and the data input to lie in a low-dimensional manifold, which helps us to reduce overfitting. We show this regularization term is…
In this work, we propose a high-order regularization method to solve the ill-conditioned problems in robot localization. Numerical solutions to robot localization problems are often unstable when the problems are ill-conditioned. A typical…
Regularization, whether explicit in terms of a penalty in the loss or implicit in the choice of algorithm, is a cornerstone of modern machine learning. Indeed, controlling the complexity of the model class is particularly important when…
This paper addresses the study and characterizations of variational convexity of extended-real-valued functions on Banach spaces. This notion has been recently introduced by Rockafellar, and its importance has been already realized and…
In this article, we investigate nonlinear metric subregularity properties of set-valued mappings between general metric or Banach spaces. We demonstrate that these properties can be treated in the framework of the theory of (linear) error…
The paper reminds the basic ideas of stochastic calculus via regularizations in Banach spaces and its applications to the study of strict solutions of Kolmogorov path dependent equations associated with "windows" of diffusion processes. One…
Low rank approximation is a commonly occurring problem in many computer vision and machine learning applications. There are two common ways of optimizing the resulting models. Either the set of matrices with a given rank can be explicitly…
We obtain a Bernstein-type inequality for sums of Banach-valued random variables satisfying a weak dependence assumption of general type and under certain smoothness assumptions of the underlying Banach norm. We use this inequality in order…
We study minimization of a structured objective function, being the sum of a smooth function and a composition of a weakly convex function with a linear operator. Applications include image reconstruction problems with regularizers that…
Constructing or learning a function from a finite number of sampled data points (measurements) is a fundamental problem in science and engineering. This is often formulated as a minimum norm interpolation problem, regularized learning…
Existence and uniqueness as well as the iterative approximation of fixed points of enriched almost contractions in Banach spaces are studied. The obtained results are generalizations of the great majority of metric fixed point theorems, in…
This article studies the problem of estimating the state variable of non-smooth subdifferential dynamics constrained in a bounded convex domain given some real-time observation. On the one hand, we show that the value function of the…
This paper investigates simple bilevel optimization problems where we minimize an upper-level objective over the optimal solution set of a convex lower-level objective. Existing methods for such problems either only guarantee asymptotic…
We aim to solve a structured convex optimization problem, where a nonsmooth function is composed with a linear operator. When opting for full splitting schemes, usually, primal-dual type methods are employed as they are effective and also…