Matrix-free interior point method for compressed sensing problems
From MaRDI portal
Publication:744215
DOI10.1007/s12532-013-0063-6zbMath1304.90137arXiv1208.5435OpenAlexW2077472656MaRDI QIDQ744215
Kimon Fountoulakis, Pavel Zhlobich, Jacek Gondzio
Publication date: 6 October 2014
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.5435
compressed sensingpreconditioned conjugate gradientcompressive sampling \(\ell _1\)-regularizationmatrix-free interior point
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Linear programming (90C05) Interior-point methods (90C51)
Related Items
Sparse Approximations with Interior Point Methods, Douglas-Rachford splitting method for semidefinite programming, OSGA: a fast subgradient algorithm with optimal complexity, Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares, A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems, An Iterative Reduction FISTA Algorithm for Large-Scale LASSO, A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods, Distributed Sparse Composite Quantile Regression in Ultrahigh Dimensions, Matrix-Free Convex Optimization Modeling, Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements, A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems, An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints, A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares, A matrix-free smoothing algorithm for large-scale support vector machines, A gradient descent based algorithm for \(\ell_p\) minimization, Interior-point solver for convex separable block-angular problems, An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems, A second-order method for convex1-regularized optimization with active-set prediction, An ADMM-based interior-point method for large-scale linear programming, A view of computational models for image segmentation, An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising, Material-separating regularizer for multi-energy x-ray tomography, An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Matrix-free interior point method
- Interior point methods 25 years later
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- A simple proof of the restricted isometry property for random matrices
- A primal-dual infeasible-interior-point algorithm for linear programming
- Multiple centrality corrections in a primal-dual method for linear programming
- Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Compressed Sensing: How Sharp Is the Restricted Isometry Property?
- On sparse reconstruction from Fourier and Gaussian measurements
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Atomic Decomposition by Basis Pursuit
- Ideal spatial adaptation by wavelet shrinkage
- Uncertainty principles and ideal atomic decomposition
- Sparsity and incoherence in compressive sampling
- An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming
- Stable signal recovery from incomplete and inaccurate measurements
- Noiselets
