Regularity properties of non-negative sparsity sets

DOI10.1016/j.jmaa.2016.10.040zbMath1353.15030arXiv1607.05924OpenAlexW2477916663MaRDI QIDQ342902

Matthew K. Tam

Publication date: 18 November 2016

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

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

zbMATH Keywords

regularityspectral functionssparsitypositive semi-definite matricesMordukhovich normal conerank constraint

Mathematics Subject Classification ID

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

Related Items

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 ⋮ Orbital geometry and group majorisation in optimisation ⋮ Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization ⋮ A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization ⋮ Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers ⋮ Method of alternating projections for the general absolute value equation

Cites Work

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