scientific article; zbMATH DE number 7733450

zbMATH Open1521.60038arXiv2205.15897MaRDI QIDQ6178237FDOQ6178237

Authors: Neal Hermer, D. Russell Luke, Anja Sturm 

Publication date: 1 September 2023

Full work available at URL: https://arxiv.org/abs/2205.15897

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

nonexpansive mappingsaveraged mappingsiterated random functionsstochastic feasibilityconvergence of Markov chaininconsistent stochastic fixed point problem

Mathematics Subject Classification ID

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)

Cites Work

• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of Modern Probability
• A Stochastic Approximation Method
• Optimal Transport
• Markov chains and stochastic stability
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• Monotone Operators and the Proximal Point Algorithm
• Title not available (Why is that?)
• Proximité et dualité dans un espace hilbertien
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• Convergence theorems for sequences of nonlinear operators in Banach spaces
• Distributed coordinate descent method for learning with big data
• Title not available (Why is that?)
• The Existence of Probability Measures with Given Marginals
• Functional Operators (AM-22), Volume 2
• Iterative averaging of entropic projections for solving stochastic convex feasibility problems
• Firmly nonexpansive mappings in classes of geodesic spaces
• Title not available (Why is that?)
• The asymptotic behavior of the composition of firmly nonexpansive mappings
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• Convergence of stochastic proximal gradient algorithm
• Stochastic forward Douglas-Rachford splitting method for monotone inclusions
• Iterated Random Functions
• Title not available (Why is that?)
• Ergodic Properties of Markov Processes
• Convex analysis and monotone operator theory in Hilbert spaces
• On the rate of convergence of Krasnosel'skiĭ-Mann iterations and their connection with sums of Bernoullis
• Randomized iterative methods for linear systems
• Random Function Iterations for Consistent Stochastic Feasibility
• Title not available (Why is that?)
• Random algorithms for convex minimization problems
• Title not available (Why is that?)
• Markov chains and invariant probabilities
• Proximity Maps for Convex Sets
• Iterative methods of solving stochastic convex feasibility problems and applications
• Lower bound technique in the theory of a stochastic differential equation
• A globally linearly convergent method for pointwise quadratically supportable convex-concave saddle point problems
• Asymptotic Behavior of Inexact Orbits for a Class of Operators in Complete Metric Spaces
• Feller processes on nonlocally compact spaces
• Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
• Strong convergence of expected-projection methods in hilbert spaces
• Consistent learning by composite proximal thresholding
• Stochastic Minimization with Constant Step-Size: Asymptotic Laws
• Title not available (Why is that?)
• New Convergence Aspects of Stochastic Gradient Algorithms
• Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
• The Expected–Projection Method: Its Behavior and Applications to Linear Operator Equations and Convex Optimization
• Projected stochastic gradients for convex constrained problems in Hilbert spaces
• A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
• Bridging the gap between constant step size stochastic gradient descent and Markov chains
• \( \alpha \)-firmly nonexpansive operators on metric spaces
• Convergence of proximal splitting algorithms in \(\operatorname{CAT}(\kappa)\) spaces and beyond
• Gradient descent learns linear dynamical systems
• Random function iterations for stochastic feasibility problems

Cited In (5)

• Some limit properties of Markov chains induced by recursive stochastic algorithms
• Title not available (Why is that?)
• Random Relaxation of Fixed-Point Iteration
• Stochastic Fixed-Point Iterations for Nonexpansive Maps: Convergence and Error Bounds
• Random function iterations for stochastic feasibility problems

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)