Regularity Properties of Non-Negative Sparsity Sets
arXiv:1607.05924 · doi:10.1016/j.jmaa.2016.10.040
Abstract
This paper investigates regularity properties of two non-negative sparsity sets: non-negative sparse vectors, and low-rank positive semi-definite matrices. Novel formulae for their Mordukhovich normal cones are given and used to formulate sufficient conditions for non-convex notions of regularity to hold. Our results provide a useful tool for justifying the application of projection methods to certain rank constrained feasibility problems.
arXiv comment22 pages
References in corpus (5)
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Douglas-Rachford Feasibility Methods for Matrix Completion Problems
- Prox-regularity of rank constraint sets and implications for algorithms
- Reflection methods for inverse problems with application to protein conformation determination
- Orbital Geometry in Optimisation
Cited by in corpus (4)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Projected gradient descent accumulates at Bouligand stationary points
- Low-Rank Matrix Optimization Over Affine Set
- Method of Alternating Projection for the Absolute Value Equation