Sparse recovery on Euclidean Jordan algebras

DOI10.1016/j.laa.2014.09.018zbMath1302.90150OpenAlexW2034919058MaRDI QIDQ471921

Lingchen Kong, Jie Sun, Jiyuan Tao, Nai-Hua Xiu

Publication date: 17 November 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2014.09.018

zbMATH Keywords

restricted isometry propertynuclear norm minimization\(s\)-goodnessexact and stable recoverynull space propertysparse recovery on Euclidean Jordan algebra

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Combinatorial optimization (90C27)

Related Items (2)

On linear convergence of projected gradient method for a class of affine rank minimization problems ⋮ Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming

Uses Software

• SCCP

Cites Work

• Unnamed Item
• Unnamed Item
• \(s\)-goodness for low-rank matrix recovery
• Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
• Null space conditions and thresholds for rank minimization
• Some inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras
• Some P-properties for linear transformations on Euclidean Jordan algebras
• The restricted isometry property and its implications for compressed sensing
• Some inertia theorems in Euclidean Jordan algebras
• The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
• Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
• Compressed sensing and best 𝑘-term approximation
• Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
• A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
• Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: Sparse recovery on Euclidean Jordan algebras