Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation

DOI10.1007/978-3-030-61887-2_6MaRDI QIDQ3384130zbMATH OpenOpenAlexFDO

Authors Anders C. Hansen, Bogdan Roman

Publication date 14 December 2021

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-61887-2_6

Mathematics Subject Classification ID

Numerical analysis (65-XX) Optics, electromagnetic theory (78-XX)

Recommendations

• Structured sparsity: discrete and convex approaches
• scientific article; zbMATH DE number 6312913
• Applied harmonic analysis and sparse approximation. Abstracts from the workshop held June 10--16, 2012.
• The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
• Compressed sensing from a harmonic analysis point of view

Cites work

• scientific article; zbMATH DE number 3980484 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A Probabilistic and RIPless Theory of Compressed Sensing
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A mathematical introduction to compressive sensing
• A theory of complexity, condition, and roundoff
• A wavelet tour of signal processing. The sparse way.
• Activity identification and local linear convergence of forward-backward-type methods
• An algorithm for total variation minimization and applications
• Breaking the coherence barrier: a new theory for compressed sensing
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Compressed sensing
• Compressed sensing and best \(k\)-term approximation
• Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior
• Computational complexity versus statistical performance on sparse recovery problems
• Condition. The geometry of numerical algorithms
• Exploiting Structure in Wavelet-Based Bayesian Compressive Sensing
• Geometric algorithms and combinatorial optimization
• Image processing with complex wavelets
• Incorporating Condition Measures into the Complexity Theory of Linear Programming
• Interpolation via weighted \(\ell_{1}\) minimization
• Introductory lectures on convex optimization. A basic course.
• Kronecker Compressive Sensing
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Linear programming, complexity theory and elementary functional analysis
• Mathematical problems for the next century
• Model-Based Compressive Sensing
• New barriers in complexity theory: on the solvability complexity index and the towers of algorithms
• On a problem posed by Steve Smale
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
• On the solvability complexity index, the n-pseudospectrum and approximations of spectra of operators
• Probably approximately correct. Nature's algorithms for learning and prospering in a complex world
• Recovering edges in ill-posed inverse problems: Optimality of curvelet frames.
• Robust optimization
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Stable and Robust Sampling Strategies for Compressive Imaging
• Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
• Structured random measurements in signal processing
• THE UNCERTAINTY PRINCIPLE ASSOCIATED WITH THE CONTINUOUS SHEARLET TRANSFORM
• The STOne Transform: Multi-Resolution Image Enhancement and Compressive Video
• The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing

Cited in

(3)

• Interior-point methods in \(l_1\) optimal sparse representation algorithms for harmonic retrieval
• Applied harmonic analysis and sparse approximation. Abstracts from the workshop held June 10--16, 2012.
• The mathematics of adversarial attacks in AI -- why deep learning is unstable despite the existence of stable neural networks

This page was built for publication: Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation

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