A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems
From MaRDI portal
Publication:3454470
DOI10.1137/141002062zbMath1371.65049arXiv1501.00047OpenAlexW1600918306MaRDI QIDQ3454470
Kimon Fountoulakis, Jacek Gondzio, Ioannis K. Dassios
Publication date: 25 November 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.00047
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Numerical methods involving duality (49M29) Newton-type methods (49M15) Preconditioners for iterative methods (65F08)
Related Items
Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares, Unnamed Item, \textit{PESO}: Probabilistic evaluation of subspaces orthogonality for wideband DOA estimation, A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing, Robust adaptive beamforming via improved worst-case performance optimization algorithm based on FDA-MIMO, \(\mathrm{L_1RIP}\)-based robust compressed sensing, Distributed Sparse Composite Quantile Regression in Ultrahigh Dimensions, Preconditioned nonlinear conjugate gradient methods based on a modified secant equation, Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements, Transformation of 2D Roesser into causal recursive separable denominator model and decomposition into 1D systems, Adaptive \(\mathrm{S}\)-transform with chirp-modulated window and its synchroextracting transform, Performance analysis and DOA estimation method over acoustic vector sensor array in the presence of polarity inconsistency, Unnamed Item, Unnamed Item, New preconditioners applied to linear programming and the compressive sensing problems, The case of a generalised linear discrete time system with infinite many solutions, Analytic loss minimization: theoretical framework of a second order optimization method, A matrix-free smoothing algorithm for large-scale support vector machines, Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines, An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization, A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization, Joint-block-sparsity for efficient 2-D DOA estimation with multiple separable observations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- Compressed sensing with coherent and redundant dictionaries
- Matrix-free interior point method for compressed sensing problems
- The restricted isometry property and its implications for compressed sensing
- Templates for convex cone problems with applications to sparse signal recovery
- An efficient augmented Lagrangian method with applications to total variation minimization
- Stable Image Reconstruction Using Total Variation Minimization
- Smoothing and First Order Methods: A Unified Framework
- Robust Sparse Analysis Regularization
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- Fast, robust total variation-based reconstruction of noisy, blurred images
- Multiple View Geometry in Computer Vision
- Algorithm 837
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Proximité et dualité dans un espace hilbertien
