On Subgradient Projectors

DOI10.1137/14096267XzbMath1316.47043arXiv1403.7135OpenAlexW1595803699MaRDI QIDQ5255001

Caifang Wang, Heinz H. Bauschke, Jia Xu, Shawn Xianfu Wang

Publication date: 11 June 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.7135

zbMATH Keywords

Fréchet differentiabilitynonexpansive mappingconvex functionmonotone operatorGâteaux differentiabilityfirmly nonexpansive mappingsubgradient projectorYamagishi-Yamada operator

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Fréchet and Gateaux differentiability in optimization (49J50) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items (10)

A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ Iterative methods for solving variational inequalities in Euclidean space ⋮ Subgradient projectors: extensions, theory, and characterizations ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting ⋮ Regular Sequences of Quasi-Nonexpansive Operators and Their Applications ⋮ Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm ⋮ Properties of subgradient projection iteration when applying to linear imaging system ⋮ A generalized block-iterative projection method for the common fixed point problem induced by cutters ⋮ On the finite convergence of a projected cutter method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative methods for fixed point problems in Hilbert spaces
• Subgradient optimization in nonsmooth optimization (including the soviet revolution)
• Calculus Without Derivatives
• Cyclic subgradient projections
• On Convex Functions Having Points of Gateaux Differentiability Which are Not Points of Fréchet Differentiability
• Accelerating the convergence of the method of alternating projections
• Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
• Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
• On Projection Algorithms for Solving Convex Feasibility Problems
• The Adaptive Projected Subgradient Method Constrained by Families of Quasi-nonexpansive Mappings and Its Application to Online Learning
• A projection method for approximating fixed points of quasi nonexpansive mappings without the usual demiclosedness condition
• Minimization of unsmooth functionals
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Dynamics in One Complex Variable. (AM-160)
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: On Subgradient Projectors