Necessary conditions for linear convergence of iterated expansive, set-valued mappings
DOI10.1007/s10107-018-1343-8zbMath1439.49032arXiv1704.08926OpenAlexW3102647677WikidataQ129035284 ScholiaQ129035284MaRDI QIDQ2297639
Marc Teboulle, Nguyen Hieu Thao, D. Russell Luke
Publication date: 20 February 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.08926
fixed pointstransversalitynonconvexcalmnessfixed point iterationfeasibilitymetric regularitymetric subregularitynonexpansivecyclic projectionssubtransversalityaveraged operatorsalmost averaged mappingselemental regularityFejér monotone
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 (14)
Cites Work
- Unnamed Item
- 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
- Enhanced metric regularity and Lipschitzian properties of variational systems
- About subtransversality of collections of sets
- Local linear convergence for alternating and averaged nonconvex projections
- Transversality and alternating projections for nonconvex sets
- About stationarity and regularity in variational analysis
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Tight global linear convergence rate bounds for Douglas-Rachford splitting
- Quantitative characterizations of regularity properties of collections of sets
- Set regularities and feasibility problems
- About regularity of collections of sets
- Linear convergence of the Douglas–Rachford method for two closed sets
- Calculus Without Derivatives
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
- Approximate subdifferentials and applications 3: the metric theory
- Regularity on a Fixed Set
- Implicit Functions and Solution Mappings
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
- Variational Analysis
- Local differentiability of distance functions
- Metric regularity and subdifferential calculus
- On Projection Algorithms for Solving Convex Feasibility Problems
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Alternating Projections on Manifolds
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Metric inequality, subdifferential calculus and applications
This page was built for publication: Necessary conditions for linear convergence of iterated expansive, set-valued mappings