Related papers: Error Estimates for Approximating Best Proximity P…
The paper deals with finite element approximations of elliptic Dirichlet boundary control problems posed on two-dimensional polygonal domains. Error estimates are derived for the approximation of the control and the state variables. Special…
Parametric and semiparametric tests of circular reflective symmetry about an unknown central direction are developed that are locally and asymptotically optimal in the Le Cam sense against asymmetric $k$-sine-skewed alternatives. The…
In this short survey, I revisit the role of the proximal point method in large scale optimization. I focus on three recent examples: a proximally guided subgradient method for weakly convex stochastic approximation, the prox-linear…
We study the convergence rate of the Circumcentered-Reflection Method (CRM) for solving the convex feasibility problem and compare it with the Method of Alternating Projections (MAP). Under an error bound assumption, we prove that both…
Nonlinear convex problems arise in various areas of applied mathematics and engineering. Classical techniques such as the relaxed proximal point algorithm (PPA) and the prediction correction (PC) method were proposed for linearly…
This paper is concerning to the geometric study of fixed points of a self-mapping on a metric space. We establish new generalized contractive conditions which ensure that a self-mapping has a fixed disc or a fixed circle. We introduce the…
A contraction analysis of risk-sensitive Riccati equations is proposed. When the state-space model is reachable and observable, a block-update implementation of the risk-sensitive filter is used to show that the N-fold composition of the…
We consider stochastic optimization problems with possibly nonsmooth integrands posed in Banach spaces and approximate these stochastic programs via a sample-based approaches. We establish the consistency of approximate Clarke stationary…
Contraction analysis considers the distance between two adjacent trajectories. If this distance is contracting, then trajectories have the same long-term behavior. The main advantage of this analysis is that it is independent of the…
We study a convergence criterion which generalises the notion of being monotonically decreasing, and introduce a quantitative version of this criterion, a so called metastable rate of asymptotic decreasingness. We then present a concrete…
We study the worst-case convergence rates of the proximal gradient method for minimizing the sum of a smooth strongly convex function and a non-smooth convex function whose proximal operator is available. We establish the exact worst-case…
Under investigation is the problem of finding the best approximation of a function in a Hilbert space subject to convex constraints and prescribed nonlinear transformations. We show that in many instances these prescriptions can be…
In this paper, a strong convergence theorem for asymptotically nonexpansive mappings in a uniformly convex and smooth Banach space is proved by using metric projections. This theorem extends and improves the recent strong convergence…
We study the dynamics of a piecewise map defined on the set of three pairwise nonparallel, nonconcurrent lines in $\mathbb{R}^2$. The geometric map of study may be analogized to the billiard map with a different reflection rule so that each…
Optimal transport maps and plans between two absolutely continuous measures $\mu$ and $\nu$ can be approximated by solving semi-discrete or fully-discrete optimal transport problems. These two problems ensue from approximating $\mu$ or both…
Locating proximal points is a component of numerous minimization algorithms. This work focuses on developing a method to find the proximal point of a convex function at a point, given an inexact oracle. Our method assumes that exact…
We present different extensions of the Banach contraction principle in the $G$-metric space setting. More precisely, we consider mappings for which the contractive condition is satisfied by a power of the mapping and for which the power…
We consider ill-posed linear operator equations with operators acting between Banach spaces. For solution approximation, the methods of choice here are projection methods onto finite dimensional subspaces, thus extending existing results…
The purpose of this paper is to study an implicit scheme for a representation of nonexpansive mappings on a closed convex subset of a smooth and uniformly convex Banach space with respect to a left regular sequence of means defined on an…
We study the generic behavior of the method of successive approximations for set-valued mappings in Banach spaces. We consider, in particular, the case of those set-valued mappings which are defined by pairs of nonexpansive mappings and…