Algorithms based on unions of nonexpansive maps

DOI10.1007/s11590-018-1249-7zbMath1456.90164arXiv1710.08227OpenAlexW3102243629MaRDI QIDQ723492

Matthew K. Tam

Publication date: 31 July 2018

Published in: Optimization Letters (Search for Journal in Brave)

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

zbMATH Keywords

fixed point iterationsparsityset-valued mapparacontracting operator

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Union averaged operators with applications to proximal algorithms for MIN-convex functions ⋮ On successive approximations for compact-valued nonexpansive mappings ⋮ Method of alternating projections for the general absolute value equation ⋮ Conical averagedness and convergence analysis of fixed point algorithms

Cites Work

• Restricted normal cones and sparsity optimization with affine constraints
• Convergence of sequential and asynchronous nonlinear paracontractions
• On the local convergence of the Douglas-Rachford algorithm
• Implicit Functions and Solution Mappings
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Algorithms based on unions of nonexpansive maps