Pages that link to "Item:Q3673556"
From MaRDI portal
The following pages link to Decomposition through formalization in a product space (Q3673556):
Displayed 50 items.
- Fundamentals of cone regression (Q289730) (← links)
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- Projection on the intersection of convex sets (Q314761) (← links)
- Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures (Q361272) (← links)
- Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space (Q420761) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
- An extrapolated iterative algorithm for multiple-set split feasibility problem (Q437508) (← links)
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes (Q486223) (← links)
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems (Q501512) (← links)
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations (Q511032) (← links)
- Algorithms for the split variational inequality problem (Q663488) (← links)
- Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← links)
- Convergence properties of dynamic string-averaging projection methods in the presence of perturbations (Q679708) (← links)
- A new projection method for finding the closest point in the intersection of convex sets (Q683336) (← links)
- A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem. (Q742898) (← links)
- Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
- Local linear convergence for alternating and averaged nonconvex projections (Q839655) (← links)
- Coincidence points by generalized Mann iterates with applications in Hilbert spaces (Q844961) (← links)
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem (Q860662) (← links)
- Visco-penalization of the sum of two monotone operators (Q939421) (← links)
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets (Q999284) (← links)
- Metric subregularity and the proximal point method (Q1034588) (← links)
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions (Q1071652) (← links)
- Strong convergence of projection-like methods in Hilbert spaces (Q1089908) (← links)
- On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
- A cyclic projection algorithm via duality (Q1123132) (← links)
- On the convergence of Han's method for convex programming with quadratic objective (Q1181736) (← links)
- On the convergence of von Neumann's alternating projection algorithm for two sets (Q1308949) (← links)
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces (Q1343646) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- A feasibility approach for constructing combinatorial designs of circulant type (Q1752612) (← links)
- The forward-backward algorithm and the normal problem (Q1752641) (← links)
- Summed squared distance error reduction by simultaneous multiprojections and applications (Q1855154) (← links)
- Generalized Mann iterates for constructing fixed points in Hilbert spaces (Q1856930) (← 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)
- 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)
- 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)