Pages that link to "Item:Q3673556"
From MaRDI portal
The following pages link to Decomposition through formalization in a product space (Q3673556):
Displayed 41 items.
- Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods (Q3114578) (← links)
- APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS (Q3122033) (← links)
- Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples (Q3298016) (← links)
- On the string averaging method for sparse common fixed‐point problems (Q3563615) (← links)
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections (Q3563617) (← links)
- Asymmetric variational inequality problems over product sets: Applications and iterative methods (Q3700355) (← links)
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization (Q4351184) (← links)
- Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters (Q4351445) (← links)
- Solving stochastic convex feasibility problems in hilbert spaces (Q4354840) (← links)
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings (Q4386120) (← links)
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space (Q4386129) (← links)
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS (Q4546045) (← links)
- Linear convergence rates for extrapolated fixed point algorithms (Q4613991) (← links)
- Modular proximal optimization for multidimensional total-variation regularization (Q4614088) (← links)
- On the strong convergence of sequences of Halpern type in Hilbert spaces (Q4646537) (← links)
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems (Q4653550) (← links)
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions (Q4678768) (← links)
- Partial regularization of the sum of two maximal monotone operators (Q4694996) (← links)
- Strong convergence of expected-projection methods in hilbert spaces (Q4845180) (← links)
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems (Q4846044) (← links)
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm (Q4976159) (← links)
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD (Q4992365) (← links)
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections (Q5013582) (← links)
- (Q5053241) (← links)
- Stochastic block projection algorithms with extrapolation for convex feasibility problems (Q5058397) (← links)
- A splitting method for finding the resolvent of the sum of two maximal monotone operators (Q5090286) (← links)
- Faster Randomized Block Kaczmarz Algorithms (Q5203967) (← links)
- Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition (Q5220312) (← links)
- Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization (Q5346622) (← links)
- A Distributed Boyle--Dykstra--Han Scheme (Q5355203) (← links)
- The cyclic Douglas–Rachford algorithm with <i>r</i>-sets-Douglas–Rachford operators (Q5379466) (← links)
- (Q5389724) (← links)
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
- Projection methods for high numerical aperture phase retrieval (Q5860805) (← links)
- On Componental Operators in Hilbert Space (Q5861983) (← links)
- Degenerate Preconditioned Proximal Point Algorithms (Q5869819) (← links)
- An acceleration scheme for Dykstra's algorithm (Q5963308) (← links)
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists (Q6046287) (← links)
- Polynomial estimates for the method of cyclic projections in Hilbert spaces (Q6076936) (← links)
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints (Q6157447) (← links)
- Resolvent and proximal compositions (Q6163860) (← links)