A computational study of a class of recursive inequalities
From MaRDI portal
Publication:6091634
Abstract: We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results concerning rates of convergence, setting out conditions under which computable rates are possible, and when not, providing corresponding rates of metastability. We then demonstrate how the aforementioned quantitative results can be applied to extract computational information from a range of proofs in nonlinear analysis. Here we provide both a new case study on subgradient algorithms, and give overviews of a selection of recent results which each involve an instance of our main recursive inequality. This paper contains the definitions of all relevant concepts from both proof theory and mathematical analysis, and as such, we hope that it is accessible to a general audience.
Cites work
- A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory
- A metastable dominated convergence theorem
- A projected gradient method for vector optimization problems
- A QUANTITATIVE VERSION OF A THEOREM DUE TO BORWEIN-REICH-SHAFRIR
- A Rate of Metastability for the Halpern Type Proximal Point Algorithm
- A subgradient-type method for the equilibrium problem over the fixed point set and its applications
- A uniform betweenness property in metric spaces and its role in the quantitative analysis of the ``lion-man game
- Abstract strongly convergent variants of the proximal point algorithm
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces
- Bounds for a nonlinear ergodic theorem for Banach spaces
- Effective asymptotic regularity for one-parameter nonexpansive semigroups
- Effective metastability of Halpern iterates in \(CAT(0)\) spaces
- Effective rates of convergence for Lipschitzian pseudocontractive mappings in general Banach spaces
- Effective rates of convergence for the resolvents of accretive operators
- Effective results on compositions of nonexpansive mappings
- Effective results on nonlinear ergodic averages in \(\text{CAT}(\kappa)\) spaces
- Extension of subgradient techniques for nonsmooth optimization in Banach spaces
- scientific article; zbMATH DE number 1069262 (Why is no real title available?)
- scientific article; zbMATH DE number 2196360 (Why is no real title available?)
- Iterative sequences for asymptotically quasi-nonexpansive mappings with error member
- Local stability of ergodic averages
- Metastability of the proximal point algorithm with multi-parameters
- Nicht konstruktiv beweisbare Sätze der Analysis
- Norm convergence of multiple ergodic averages for commuting transformations
- On modified Halpern and Tikhonov-Mann iterations
- On preserving the computational content of mathematical proofs: toy examples for a formalising strategy
- On the Borel-Cantelli Lemmas, the Erdős-Rényi Theorem, and the Kochen-Stone Theorem
- On the Interpretation of Non-Finitist Proofs--Part I
- On the interpretation of non-finitist proofs–Part II
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- On the projection methods for fixed point problems
- Proof mining and effective bounds in differential polynomial rings
- PROOF-THEORETIC METHODS IN NONLINEAR ANALYSIS
- Quadratic rates of asymptotic regularity for the Tikhonov–Mann iteration
- Quantitative analysis of a Halpern-type proximal point algorithm for accretive operators in Banach spaces
- Quantitative analysis of a subgradient-type method for equilibrium problems
- Quantitative analysis of iterative algorithms in fixed point theory and convex optimization
- Quantitative results on a Halpern-type proximal point algorithm
- Quantitative results on the multi-parameters proximal point algorithm
- Quantitative translations for viscosity approximation methods in hyperbolic spaces
- Rates of asymptotic regularity for Halpern iterations of nonexpansive mappings
- Rates of convergence and metastability for abstract Cauchy problems generated by accretive operators
- Rates of convergence for asymptotically weakly contractive mappings in normed spaces
- Rates of convergence for iterative solutions of equations involving set-valued accretive operators
- Revisiting jointly firmly nonexpansive families of mappings
- Some logical metatheorems with applications in functional analysis
- Strong Convergence for the Alternating Halpern–Mann Iteration in CAT(0) Spaces
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- The asymptotic behavior of the solutions of the Cauchy problem generated by \(\phi\)-accretive operators
- The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
Cited in
(3)
This page was built for publication: A computational study of a class of recursive inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091634)
