Strong convergence of expected-projection methods in hilbert spaces
From MaRDI portal
Recommendations
- Strong convergence of projection-like methods in Hilbert spaces
- On the strong convergence of a projection-based algorithm in Hilbert spaces
- Strong convergence of the gradient-projection algorithm in Hilbert spaces
- Strong convergence of a generalized-projection method in Banach spaces
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
- Strong convergence of generalized projection algorithms for nonlinear operators
- Strong convergence of a projected gradient method
- Weak and norm convergence of a parallel projection method in Hilbert spaces
Cites work
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Convergence of convex sets and of solutions of variational inequalities
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Convex analysis and measurable multifunctions
- Decomposition through formalization in a product space
- Error bounds for the method of alternating projections
- Generalized Image Restoration by the Method of Alternating Orthogonal Projections
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 3907726 (Why is no real title available?)
- scientific article; zbMATH DE number 125933 (Why is no real title available?)
- scientific article; zbMATH DE number 3575883 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Iterative methods for best approximate solutions of linear integral equations of the first and second kinds
- Lagrange Multipliers in Stochastic Programming
- On rings of operators. Reduction theory
- On systems of inequalities with convex functions in the left sides
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- On the Convergence of the Products of Firmly Nonexpansive Mappings
- On the factorization of matrices
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- Optimization and nonsmooth analysis
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Relaxed outer projections, weighted averages and convex feasibility
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Set-valued analysis
- Strong convergence of projection-like methods in Hilbert spaces
- The method of projections for finding the common point of convex sets
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
Cited in
(21)- An estimate for Lipschitz constants of metric projections
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Iterative methods of solving stochastic convex feasibility problems and applications
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Weak and norm convergence of a parallel projection method in Hilbert spaces
- The expected retraction method in Banach spaces
- Unconstrained optimization techniques for the acceleration of alternating projection methods
- Random function iterations for consistent stochastic feasibility
- Non-Convex feasibility problems and proximal point methods
- The Expected–Projection Method: Its Behavior and Applications to Linear Operator Equations and Convex Optimization
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- Non-monotoneous parallel iteration for solving convex feasibility problems.
- Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem
- A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces
- The method of randomized Bregman projections for stochastic feasibility problems
- scientific article; zbMATH DE number 7733450 (Why is no real title available?)
- Integral resolvent and proximal mixtures
- Hilbertian convex feasibility problem: Convergence of projection methods
- Convergence in distribution of randomized algorithms: the case of partially separable optimization
- Hilbert direct integrals of monotone operators
- Stochastic algorithms for large-scale composite optimization: the case of likelihood maximization for X-FEL imaging
This page was built for publication: Strong convergence of expected-projection methods in hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845180)
