Algorithms based on unions of nonexpansive maps

DOI10.1007/S11590-018-1249-7MaRDI QIDQ723492zbMATH OpenOpenAlexWikidataFDO

Authors 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

sparsityfixed point iterationset-valued mapparacontracting operator

Mathematics Subject Classification ID

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

Abstract: In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be expressed as a finite union of values of single-valued paracontracting operators. Our main result, which shows that the associated fixed point iteration is locally convergent around strong fixed points, generalises a theorem due to Bauschke and Noll (2014).

Recommendations

• Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
• Union averaged operators with applications to proximal algorithms for MIN-convex functions
• Iterative algorithms for nonexpansive mappings
• Convergence of inexact iterative schemes for nonexpansive set-valued mappings
• Iterative algorithms with variable anchors for non-expansive mappings

Cites work

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

Cited in

(8)

• Method of alternating projections for the general absolute value equation
• A sequential constraint method for solving variational inequality over the intersection of fixed point sets
• Union averaged operators with applications to proximal algorithms for MIN-convex functions
• On successive approximations for compact-valued nonexpansive mappings
• Conical averagedness and convergence analysis of fixed point algorithms
• The Douglas-Rachford algorithm for convex and nonconvex feasibility problems
• Approximate solutions for three fixed point problems
• Global convergence and acceleration of projection methods for feasibility problems involving union convex sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723492)