Union averaged operators with applications to proximal algorithms for MIN-convex functions

DOI10.1007/s10957-018-1443-xzbMath1420.90047arXiv1807.05810OpenAlexW2883816074WikidataQ128876691 ScholiaQ128876691MaRDI QIDQ2420769

Minh N. Dao, Matthew K. Tam

Publication date: 7 June 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

local convergencefixed point iterationset-valued mapproximal algorithmsaveraged operatoradmissible control

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Set-valued operators (47H04)

Related Items

The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ On successive approximations for compact-valued nonexpansive mappings ⋮ Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness ⋮ Method of alternating projections for the general absolute value equation ⋮ Conical averagedness and convergence analysis of fixed point algorithms

Cites Work

• Unnamed Item
• Linear and strong convergence of algorithms involving averaged nonexpansive operators
• Iterative methods for fixed point problems in Hilbert spaces
• Compositions and convex combinations of averaged nonexpansive operators
• Algorithms based on unions of nonexpansive maps
• Convergence of sequential and asynchronous nonlinear paracontractions
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• A cyclic Douglas-Rachford iteration scheme
• On the local convergence of the Douglas-Rachford algorithm
• On the convexity of piecewise-defined functions
• Functional Analysis, Calculus of Variations and Optimal Control
• Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• Linear Convergence of Projection Algorithms
• Outer limits of subdifferentials for min–max type functions
• The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
• Implicit Functions and Solution Mappings
• Exact calculus for proximal subgradients with applications to optimization
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces
• Convex analysis and monotone operator theory in Hilbert spaces