Transversality and alternating projections for nonconvex sets
From MaRDI portal
Publication:895706
DOI10.1007/S10208-015-9279-3zbMATH Open1338.49057arXiv1401.7569OpenAlexW1145378817MaRDI QIDQ895706FDOQ895706
Authors: A. S. Lewis, D. Drusvyatskiy, Alexander D. Ioffe 
Publication date: 4 December 2015
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Abstract: We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear convergence. When the two sets are semi-algebraic and bounded, but not necessarily transversal, we nonetheless prove subsequence convergence.
Full work available at URL: https://arxiv.org/abs/1401.7569
Recommendations
- Local linear convergence for inexact alternating projections on nonconvex sets
- Local linear convergence for alternating and averaged nonconvex projections
- The method of alternating relaxed projections for two nonconvex sets
- Alternating Projections on Manifolds
- On local convergence of the method of alternating projections
Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Numerical methods of relaxation type (49M20)
Cites Work
- Variational Analysis
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Techniques of variational analysis
- Clarke Subgradients of Stratifiable Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metric regularity and subdifferential calculus
- Title not available (Why is that?)
- The method of projections for finding the common point of convex sets
- Functional Operators (AM-22), Volume 2
- On gradients of functions definable in o-minimal structures
- On local convergence of the method of alternating projections
- Restricted normal cones and the method of alternating projections: applications
- Restricted normal cones and the method of alternating projections: theory
- Alternating Projections on Manifolds
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- Local linear convergence for alternating and averaged nonconvex projections
- An Invitation to Tame Optimization
- Critical values of set-valued maps with stratifiable graphs. Extensions of Sard and Smale-Sard theorems
- Alternating projections on nontangential manifolds
- Quantitative characterizations of regularity properties of collections of sets
- Transversality and alternating projections for nonconvex sets
- Regularity of collections of sets and convergence of inexact alternating projections
- A Sard theorem for tame set-valued mappings
- Curves of descent
- Nonsmooth optimization: conditioning, convergence and semi-algebraic models
Cited In (62)
- On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications
- About subtransversality of collections of sets
- Implicit functions: a metric theory
- Dual sufficient characterizations of transversality properties
- Primal necessary characterizations of transversality properties
- Frame completion with prescribed norms via alternating projection method
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Metric regularity -- a survey. II: Applications
- Local linear convergence of alternating projections in metric spaces with bounded curvature
- Linear convergence of projection algorithms
- On cluster points of alternating projections
- Restricted normal cones and the method of alternating projections: theory
- Alternating Projections on Manifolds
- About intrinsic transversality of pairs of sets
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Nonlinear transversality of collections of sets: dual space necessary characterizations
- A convergent relaxation of the Douglas-Rachford algorithm
- Provable Phase Retrieval with Mirror Descent
- Transversality properties: primal sufficient conditions
- Local linear convergence for alternating and averaged nonconvex projections
- Characterizations of some transversality-type properties
- Geometric and metric characterizations of transversality properties
- Implicit error bounds for Picard iterations on Hilbert spaces
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Extremality, stationarity and generalized separation of collections of sets
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Set regularities and feasibility problems
- Some convergence strategies for the alternating generalized projection method
- Necessary conditions for linear convergence of iterated expansive, set-valued mappings
- A factorization method for completely positive matrices
- Well-posedness and generalized metric subregularity with respect to an admissible function
- Sufficient condition for tangential transversality
- Some new characterizations of intrinsic transversality in Hilbert spaces
- Regularity properties in variational analysis and applications in optimisation. (Abstract of thesis)
- Metric inequality conditions on sets and consequences in optimization
- Circumcentering approximate reflections for solving the convex feasibility problem
- On tangential transversality
- A cyclic Douglas-Rachford iteration scheme
- Necessary conditions for non-intersection of collections of sets
- Local linear convergence for inexact alternating projections on nonconvex sets
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- The method of alternating relaxed projections for two nonconvex sets
- A note on the finite convergence of alternating projections
- Alternating projections with applications to Gerchberg-Saxton error reduction
- Projection methods for quantum channel construction
- Nonsmooth optimization: conditioning, convergence and semi-algebraic models
- Transversality and alternating projections for nonconvex sets
- Diagonally Dominant Principal Component Analysis
- A penalized method of alternating projections for weighted low-rank Hankel matrix optimization
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting
- Finding a low-rank basis in a matrix subspace
- Alternating projections on nontangential manifolds
- Transversality in variational analysis
- On a numerical construction of doubly stochastic matrices with prescribed eigenvalues
- Generalized alternating projections on manifolds and convex sets
- Transversal families of nonlinear projections and generalizations of Favard length
- Exact convergence rates of alternating projections for nontransversal intersections
- Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow
- Eigenvalue programming beyond matrices
- Extremality of families of sets
- Single-projection procedure for infinite dimensional convex optimization problems
- On the centralization of the circumcentered-reflection method
This page was built for publication: Transversality and alternating projections for nonconvex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895706)
