scientific article; zbMATH DE number 806611

From MaRDI portal
Revision as of 03:27, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4850462

zbMath0830.65047MaRDI QIDQ4850462

Patrick L. Combettes

Publication date: 4 February 1996


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (23)

Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive MappingsString-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite casesCoincidence points by generalized Mann iterates with applications in Hilbert spacesIterative selection methods for common fixed point problemsApproximation methods for common fixed points of nonexpansive mappings in Hilbert spacesInertial iterative process for fixed points of certain quasi-nonexpansive mappingsDeep neural network structures solving variational inequalitiesWarped proximal iterations for monotone inclusionsBlock-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spacesStrong convergence for an iterative method for the triple-hierarchical constrained optimization problemResolvent and proximal compositionsOn the incomplete oblique projections method for solving box constrained least squares problemsHilbertian convex feasibility problem: Convergence of projection methodsMinimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappingsApproximations to fixed points of contraction semigroups in hilbert spacesQuadratic optimization of fixed points of nonexpansive mappings in hubert spaceExtrapolation algorithm for affine-convex feasibility problemsComputational acceleration of projection algorithms for the linear best approximation problemSolving composite fixed point problems with block updatesHybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mappingUnnamed ItemFenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappingsGeneralized Mann iterates for constructing fixed points in Hilbert spaces







This page was built for publication: