scientific article; zbMATH DE number 7733450
From MaRDI portal
Publication:6178237
nonexpansive mappingsaveraged mappingsiterated random functionsstochastic feasibilityconvergence of Markov chaininconsistent stochastic fixed point problem
Numerical analysis or methods applied to Markov chains (65C40) Numerical mathematical programming methods (65K05) Applications of functional analysis in probability theory and statistics (46N30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Set-valued and variational analysis (49J53) Existence of optimal solutions to problems involving randomness (49J55)
Recommendations
- Random function iterations for stochastic feasibility problems
- Random function iterations for consistent stochastic feasibility
- Generic convergence of algorithms for solving stochastic feasibility problems
- Random Relaxation of Fixed-Point Iteration
- Convergence of iterative algorithms to common random fixed points of random operators
Cites work
- scientific article; zbMATH DE number 3125504 (Why is no real title available?)
- scientific article; zbMATH DE number 3790697 (Why is no real title available?)
- scientific article; zbMATH DE number 3615396 (Why is no real title available?)
- scientific article; zbMATH DE number 739280 (Why is no real title available?)
- scientific article; zbMATH DE number 1542660 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 932401 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 2235418 (Why is no real title available?)
- A Stochastic Approximation Method
- A globally linearly convergent method for pointwise quadratically supportable convex-concave saddle point problems
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
- Asymptotic Behavior of Inexact Orbits for a Class of Operators in Complete Metric Spaces
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- Bridging the gap between constant step size stochastic gradient descent and Markov chains
- Consistent learning by composite proximal thresholding
- Convergence of proximal splitting algorithms in \(\operatorname{CAT}(\kappa)\) spaces and beyond
- Convergence of stochastic proximal gradient algorithm
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed coordinate descent method for learning with big data
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Ergodic Properties of Markov Processes
- Feller processes on nonlocally compact spaces
- Firmly nonexpansive mappings in classes of geodesic spaces
- Foundations of Modern Probability
- Functional Operators (AM-22), Volume 2
- Gradient descent learns linear dynamical systems
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- Iterated Random Functions
- Iterative averaging of entropic projections for solving stochastic convex feasibility problems
- Iterative methods of solving stochastic convex feasibility problems and applications
- Lower bound technique in the theory of a stochastic differential equation
- Markov chains and invariant probabilities
- Markov chains and stochastic stability
- Monotone Operators and the Proximal Point Algorithm
- New Convergence Aspects of Stochastic Gradient Algorithms
- On the rate of convergence of Krasnosel'skiĭ-Mann iterations and their connection with sums of Bernoullis
- Optimal Transport
- Projected stochastic gradients for convex constrained problems in Hilbert spaces
- Proximity Maps for Convex Sets
- Proximité et dualité dans un espace hilbertien
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Random algorithms for convex minimization problems
- Random function iterations for consistent stochastic feasibility
- Random function iterations for stochastic feasibility problems
- Randomized iterative methods for linear systems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Stochastic Minimization with Constant Step-Size: Asymptotic Laws
- Stochastic forward Douglas-Rachford splitting method for monotone inclusions
- Strong convergence of expected-projection methods in hilbert spaces
- The Existence of Probability Measures with Given Marginals
- The Expected–Projection Method: Its Behavior and Applications to Linear Operator Equations and Convex Optimization
- The asymptotic behavior of the composition of firmly nonexpansive mappings
- \( \alpha \)-firmly nonexpansive operators on metric spaces
Cited in
(6)- Random Relaxation of Fixed-Point Iteration
- Random function iterations for stochastic feasibility problems
- Some limit properties of Markov chains induced by recursive stochastic algorithms
- Random function iterations for consistent stochastic feasibility
- Stochastic Fixed-Point Iterations for Nonexpansive Maps: Convergence and Error Bounds
- scientific article; zbMATH DE number 7733424 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178237)
