scientific article; zbMATH DE number 3539991
From MaRDI portal
Publication:4115737
zbMath0346.49032MaRDI QIDQ4115737
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
The Douglas–Rachford Algorithm in the Absence of Convexity ⋮ Proximal Splitting Methods in Signal Processing ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ Strong convergence of projection-like methods in Hilbert spaces ⋮ Local linear convergence for alternating and averaged nonconvex projections ⋮ Finding best approximation pairs relative to two closed convex sets in Hilbert spaces ⋮ Resolvent and proximal compositions ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Prox-regularity of rank constraint sets and implications for algorithms ⋮ Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings ⋮ Quadratic optimization of fixed points of nonexpansive mappings in hubert space ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space ⋮ Construction of best Bregman approximations in reflexive Banach spaces ⋮ Reconstruction of functions from prescribed proximal points ⋮ Decomposition through formalization in a product space ⋮ Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
This page was built for publication:
