Pages that link to "Item:Q3673556"

The following pages link to Decomposition through formalization in a product space (Q3673556):

Displaying 50 items.

• Circumcentering reflection methods for nonconvex feasibility problems (Q2158827) (← links)
• A direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizes (Q2158832) (← links)
• A product space reformulation with reduced dimension for splitting algorithms (Q2162533) (← links)
• An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← links)
• Strengthened splitting methods for computing resolvents (Q2231047) (← links)
• Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
• Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem (Q2350395) (← links)
• Weak and norm convergence of a parallel projection method in Hilbert spaces (Q2366626) (← links)
• The optimal error bound for the method of simultaneous projections (Q2406901) (← links)
• Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm (Q2420809) (← links)
• The Douglas-Rachford algorithm for a hyperplane and a doubleton (Q2423795) (← links)
• How good are projection methods for convex feasibility problems? (Q2427393) (← links)
• Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
• Set intersection problems: supporting hyperplanes and quadratic programming (Q2515044) (← links)
• On the asymptotic behavior of some alternate smoothing series expansion iterative methods (Q2639624) (← links)
• On the circumcentered-reflection method for the convex feasibility problem (Q2661677) (← links)
• A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting (Q2700012) (← links)
• Convergence of string-averaging method for a class of operators (Q2829581) (← links)
• The rate of convergence in the method of alternating projections (Q2892177) (← links)
• Proximal Splitting Methods in Signal Processing (Q2897282) (← links)
• Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings (Q2897289) (← links)
• Distributed solutions for loosely coupled feasibility problems using proximal splitting methods (Q2943811) (← links)
• A survey on operator splitting and decomposition of convex programs (Q2969955) (← links)
• 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)