Regularity properties of non-negative sparsity sets
From MaRDI portal
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.
Recommendations
- Prox-regularity of rank constraint sets and implications for algorithms
- Set regularities and feasibility problems
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- On the regularity condition in a convex feasibility problem
- Regularity of collections of sets and convergence of inexact alternating projections
Cites work
- A fresh variational-analysis look at the positive semidefinite matrices world
- A mathematical introduction to compressive sensing
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Alternating Projections on Manifolds
- Approximation algorithms and semidefinite programming.
- Approximation by matrices positive semidefinite on a subspace
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Convex analysis and nonlinear optimization. Theory and examples.
- Douglas-Rachford feasibility methods for matrix completion problems
- Entropic regularization of the \(\ell _{0}\) function
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Just relax: convex programming methods for identifying sparse signals in noise
- Linear convergence of the Douglas-Rachford method for two closed sets
- Local differentiability of distance functions
- Local linear convergence for alternating and averaged nonconvex projections
- Nonsmooth analysis of eigenvalues
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Prox-regularity of rank constraint sets and implications for algorithms
- Prox-regularity of spectral functions and spectral sets
- Restricted normal cones and sparsity optimization with affine constraints
- Restricted normal cones and the method of alternating projections: theory
- Sparse Approximate Solutions to Linear Systems
- Stable signal recovery from incomplete and inaccurate measurements
- The mathematics of eigenvalue optimization
Cited in
(10)- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Prox-regularity of rank constraint sets and implications for algorithms
- Method of alternating projections for the general absolute value equation
- Orbital geometry and group majorisation in optimisation
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- A note on ``Reguralizers for structured sparsity
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds
- Copositivity and sparsity relations using spectral properties
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
This page was built for publication: Regularity properties of non-negative sparsity sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342902)
