Regularity properties of non-negative sparsity sets

DOI10.1016/J.JMAA.2016.10.040zbMATH Open1353.15030arXiv1607.05924OpenAlexW2477916663MaRDI QIDQ342902FDOQ342902

Matthew K. Tam

Publication date: 18 November 2016

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1607.05924

zbMATH Keywords

sparsityregularityMordukhovich normal conespectral functionsrank constraintpositive semi-definite matrices

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48)

Cites Work

• Title not available (Why is that?)
• Just relax: convex programming methods for identifying sparse signals in noise
• A fresh variational-analysis look at the positive semidefinite matrices world
• Stable signal recovery from incomplete and inaccurate measurements
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• On the convergence of von Neumann's alternating projection algorithm for two sets
• A mathematical introduction to compressive sensing
• Local differentiability of distance functions
• Restricted normal cones and sparsity optimization with affine constraints
• Sparse Approximate Solutions to Linear Systems
• Nonsmooth analysis of eigenvalues
• Linear convergence of the Douglas–Rachford method for two closed sets
• Restricted normal cones and the method of alternating projections: theory
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• Alternating Projections on Manifolds
• Convex analysis and nonlinear optimization. Theory and examples.
• Local linear convergence for alternating and averaged nonconvex projections
• Douglas-Rachford feasibility methods for matrix completion problems
• Approximation by matrices positive semidefinite on a subspace
• The mathematics of eigenvalue optimization
• Prox-regularity of rank constraint sets and implications for algorithms
• Entropic Regularization of the ℓ 0 Function
• Approximation Algorithms and Semidefinite Programming
• Computing the nearest Euclidean distance matrix with low embedding dimensions

Cited In (8)

• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
• 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
• 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)