Solving stochastic convex feasibility problems in hilbert spaces

DOI10.1080/01630569608816731MaRDI QIDQ4354840zbMATH OpenOpenAlexFDO

Authors Gilbert Crombez

Publication date 27 October 1997

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630569608816731

zbMATH Keywords

almost common pointexpected-projection methodsstochastic convex feasibility problems

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) General theory of numerical analysis in abstract spaces (65J05) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Random operators and equations (aspects of stochastic analysis) (60H25)

Recommendations

• scientific article; zbMATH DE number 3963568
• Iterative methods of solving stochastic convex feasibility problems and applications
• Some methods of stochastic programming in Hilbert space
• scientific article; zbMATH DE number 3306373
• Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
• scientific article; zbMATH DE number 3956819
• Convex approximations in stochastic programming by semidefinite programming
• Stochastic convexity and its applications
• Hilbertian convex feasibility problem: Convergence of projection methods
• Solution of nonconvex nonsmooth stochastic optimization problems

Cites work

• scientific article; zbMATH DE number 3357080 (Why is no real title available?)
• An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
• Decomposition through formalization in a product space
• Finding projections onto the intersection of convex sets in hilbert spaces
• Iterations of parallel convex projections in hilbert spaces
• The method of projections for finding the common point of convex sets
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
• Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems

Cited in

(3)

• The expected retraction method in Banach spaces
• Generic convergence of methods for solving stochastic feasibility problems
• Projected stochastic gradients for convex constrained problems in Hilbert spaces

This page was built for publication: Solving stochastic convex feasibility problems in hilbert spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354840)