Competitive optimization of compressed sensing

DOI10.1088/1751-8113/40/16/F02MaRDI QIDQ3435879zbMATH OpenFDO

Authors M. Andrecut, R. A. Este, Stuart A. Kauffman

Publication date 7 May 2007

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1751-8113/40/16/F02

zbMATH Keywords

annealing algorithm

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Competitive optimization of compressed sensing
• Near-Optimal Adaptive Compressed Sensing
• Compressed sensing
• Compressed sensing
• Compressive sensing
• Compressive Sensing
• Compression-Based Compressed Sensing
• Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
• Optimized Projections for Compressed Sensing
• scientific article; zbMATH DE number 6312913

Cited in

(3)

• Discrete optimization methods for group model selection in compressed sensing
• Optimized projections for compressed sensing via rank-constrained nearest correlation matrix
• Optimized measurement matrix for compressive sensing

This page was built for publication: Competitive optimization of compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3435879)