Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings

DOI10.1287/moor.2017.0898zbMath1434.49012arXiv1605.05725OpenAlexW2396782186MaRDI QIDQ5219693

D. Russell Luke, Matthew K. Tam, Nguyen Hieu Thao

Publication date: 12 March 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

fixed pointstransversalityanalysis of algorithmslinear convergencenonconvexfeasibilitymetric regularitynonsmoothKurdyka-Łojasiewicz inequalityproximal algorithmssubtransversality

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, well-posedness (49K40) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Set-valued and variational analysis (49J53) Decomposition methods (49M27)

Related Items (26)

Convergence of proximal splitting algorithms in \(\operatorname{CAT}(\kappa)\) spaces and beyond ⋮ On a notion of averaged mappings in \(\operatorname{CAT}(0)\) spaces ⋮ Non-convex split Feasibility problems: models, algorithms and theory ⋮ A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Radius theorems for subregularity in infinite dimensions ⋮ Provable Phase Retrieval with Mirror Descent ⋮ Exact convergence rates of alternating projections for nontransversal intersections ⋮ Golden ratio algorithms for variational inequalities ⋮ Subgradient projectors: extensions, theory, and characterizations ⋮ Unnamed Item ⋮ Random Function Iterations for Consistent Stochastic Feasibility ⋮ Convolutional proximal neural networks and plug-and-play algorithms ⋮ About intrinsic transversality of pairs of sets ⋮ Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval ⋮ On \(\alpha\)-firmly nonexpansive operators in \(r\)-uniformly convex spaces ⋮ Constraint reduction reformulations for projection algorithms with applications to wavelet construction ⋮ Necessary conditions for linear convergence of iterated expansive, set-valued mappings ⋮ Convergence Analysis of the Relaxed Douglas--Rachford Algorithm ⋮ Linear Convergence of Projection Algorithms ⋮ Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems ⋮ \( \alpha \)-firmly nonexpansive operators on metric spaces ⋮ Metric regularity relative to a cone ⋮ Projection methods for high numerical aperture phase retrieval ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons ⋮ Phase Retrieval with Sparse Phase Constraint

Uses Software

• PhaseLift

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• On local convergence of the method of alternating projections
• Nonlinear regularity models
• Restricted normal cones and the method of alternating projections: applications
• Restricted normal cones and the method of alternating projections: theory
• Restricted normal cones and sparsity optimization with affine constraints
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Local linear convergence of approximate projections onto regularized sets
• Asymptotic behaviour of almost nonexpansive sequences in a Hilbert space
• Über die Methode sukzessiver Approximationen
• Local linear convergence for alternating and averaged nonconvex projections
• Transversality and alternating projections for nonconvex sets
• Optimization methods and stability of inclusions in Banach spaces
• Monotone (nonlinear) operators in Hilbert space
• Extension problems for accretive sets in Banach spaces
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Approximate convexity and submonotonicity.
• Error bounds and implicit multifunction theorem in smooth Banach spaces and applications to optimization
• Quantitative characterizations of regularity properties of collections of sets
• A globally linearly convergent method for pointwise quadratically supportable convex-concave saddle point problems
• Set regularities and feasibility problems
• About regularity of collections of sets
• Degree theory for local condensing maps
• Fixed points of condensing functions
• Uniformity and inexact version of a proximal method for metrically regular mappings
• Linear convergence of the Douglas–Rachford method for two closed sets
• The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces
• The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
• Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
• Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
• Regularity on a Fixed Set
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Error Bounds in Metric Spaces and Application to the Perturbation Stability of Metric Regularity
• Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
• Submonotone Subdifferentials of Lipschitz Functions
• Metric regularity, openness and Lipschitzian behavior of multifunctions
• Variational Analysis
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• Variational Analysis Applied to the Problem of Optical Phase Retrieval
• Local differentiability of distance functions
• Optical Wavefront Reconstruction: Theory and Numerical Methods
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Proximal Methods for Cohypomonotone Operators
• Relaxed averaged alternating reflections for diffraction imaging
• Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging
• Quantitative asymptotic regularity results for the composition of two mappings
• Alternating Projections on Manifolds
• Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
• Implicit Functions and Solution Mappings
• Convergence of the Proximal Point Method for Metrically Regular Mappings
• Proximité et dualité dans un espace hilbertien
• A Remark on a Theorem of M. A. Krasnoselski
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• The method of projections for finding the common point of convex sets
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
• Mean Value Methods in Iteration
• Phase Retrieval via Matrix Completion
• Convex analysis and monotone operator theory in Hilbert spaces
• Set-valued analysis

This page was built for publication: Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings