Pages that link to "Item:Q678107"
From MaRDI portal
The following pages link to Hilbertian convex feasibility problem: Convergence of projection methods (Q678107):
Displaying 50 items.
- Some results for split equality equilibrium problems in Banach spaces (Q2310999) (← links)
- An iterative algorithm for common fixed points for nonexpansive semigroups and strictly pseudo-contractive mappings with optimization problems (Q2393086) (← links)
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions (Q2413104) (← links)
- Polyak's gradient method for split feasibility problem constrained by level sets (Q2413285) (← links)
- Convergence rates for Kaczmarz-type algorithms (Q2413487) (← links)
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces (Q2427283) (← links)
- Iterative approaches to convex feasibility problems in Banach spaces (Q2492485) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space (Q2502868) (← links)
- Stadium norm and Douglas-Rachford splitting: a new approach to road design optimization (Q2806070) (← links)
- On projection reflection method in Hilbert spaces (Q2812275) (← links)
- Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces (Q2836093) (← links)
- Opial-Type Theorems and the Common Fixed Point Problem (Q2897281) (← links)
- Convergence of projection algorithms to approximate solutions of convex feasibility problems (Q2906313) (← links)
- Automated Multilateral Negotiation on Multiple Issues with Private Information (Q2960357) (← links)
- The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments (Q3455009) (← links)
- (Q3517685) (← links)
- Solving stochastic convex feasibility problems in hilbert spaces (Q4354840) (← links)
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery (Q4559404) (← links)
- CONVERGENCE OF MANN’S ALTERNATING PROJECTIONS IN CAT() SPACES (Q4576827) (← links)
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour (Q4613990) (← links)
- Linear convergence rates for extrapolated fixed point algorithms (Q4613991) (← links)
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications (Q4641669) (← links)
- Solving monotone inclusions via compositions of nonexpansive averaged operators (Q4669785) (← links)
- Nesterov perturbations and projection methods applied to IMRT (Q4959911) (← links)
- Convex feasibility problems on uniformly convex metric spaces (Q4972543) (← links)
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm (Q4976159) (← links)
- -CONVERGENCES OF WEIGHTED AVERAGED PROJECTIONS IN SPACES (Q4992362) (← links)
- Perturbed iterative methods for a general family of operators: convergence theory and applications (Q4999746) (← links)
- (Q5042644) (← links)
- A tight smooth approximation of the maximum function and its applications (Q5055095) (← links)
- Stochastic block projection algorithms with extrapolation for convex feasibility problems (Q5058397) (← links)
- An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces (Q5065443) (← links)
- (Q5114260) (← links)
- Projection algorithms with dynamic stepsize for constrained composite minimization (Q5225430) (← links)
- (Q5236910) (← links)
- General Iterative Methods for Semigroups of Nonexpansive Mappings Related to Optimization Problems (Q5238074) (← links)
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
- Hierarchical Minimization Problems and Applications (Q5259715) (← links)
- Convergence of weighted averages of relaxed projections (Q5375916) (← links)
- String-averaging algorithms for convex feasibility with infinitely many sets (Q5382471) (← links)
- Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem (Q5459816) (← links)
- Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ? (Q5710542) (← links)
- On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces (Q5737718) (← links)
- Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications (Q5861980) (← links)
- Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces (Q6102172) (← links)
- Primal characterizations of error bounds for composite-convex inequalities (Q6178248) (← links)
- Effective metastability for a method of alternating resolvents (Q6576132) (← links)
- A finitely convergent circumcenter method for the convex feasibility problem (Q6579996) (← links)
- Projection methods for finding the greatest element of the intersection of max-closed convex sets (Q6638853) (← links)