Restricted normal cones and the method of alternating projections: applications

DOI10.1007/s11228-013-0238-3zbMath1349.65191MaRDI QIDQ368468

Hung M. Phan, Heinz H. Bauschke, D. Russell Luke, Shawn Xianfu Wang

Publication date: 23 September 2013

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-013-0238-3

zbMATH Keywords

normal cone; linear convergence; convex set; projection operator; Friedrichs angle; method of alternating projections; nonconvex set; restricted normal cone; superregularity

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

65K10: Numerical optimization and variational techniques

49J52: Nonsmooth analysis

49M37: Numerical methods based on nonlinear programming

47H04: Set-valued operators

49M20: Numerical methods of relaxation type

Related Items

Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings, Linear Convergence of Projection Algorithms, Provable Phase Retrieval with Mirror Descent, On local convergence of the method of alternating projections, Restricted normal cones and the method of alternating projections: theory, Restricted normal cones and sparsity optimization with affine constraints, The method of alternating relaxed projections for two nonconvex sets, On the existence of minimizers of proximity functions for split feasibility problems, About subtransversality of collections of sets, A convergent relaxation of the Douglas-Rachford algorithm, Transversality and alternating projections for nonconvex sets, Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems, Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm, About intrinsic transversality of pairs of sets, Metric inequality conditions on sets and consequences in optimization, Prox-regularity of rank constraint sets and implications for algorithms, Necessary conditions for linear convergence of iterated expansive, set-valued mappings, Set regularities and feasibility problems, Nonnegative low rank tensor approximations with multidimensional image applications, Linear convergence of the Douglas–Rachford method for two closed sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted normal cones and the method of alternating projections: theory
• Restricted normal cones and sparsity optimization with affine constraints
• Local linear convergence of approximate projections onto regularized sets
• Local linear convergence for alternating and averaged nonconvex projections
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• Method of successive projections for finding a common point of sets in metric spaces
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Techniques of variational analysis
• On the factorization of matrices
• Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
• On Projection Algorithms for Solving Convex Feasibility Problems
• Alternating Projections on Manifolds
• Convex Analysis
• The method of projections for finding the common point of convex sets
• Functional Operators (AM-22), Volume 2
• Étude sur les variétés et les opérateurs de Julia, avec quelques applications
• Convex analysis and monotone operator theory in Hilbert spaces
• Best approximation in inner product spaces