Coordinate descent optimization for l^1 minimization with application to compressed sensing; a greedy algorithm
From MaRDI portal
Publication:2268312
Recommendations
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Minimization of \(\ell_{1-2}\) for compressed sensing
- A gradient based method for the \(L_{2}-L_{1/2}\) minimization and application to compressive sensing
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- Iterative \({\ell_1}\) minimization for non-convex compressed sensing
- A fast proximal point algorithm for \(\ell_{1}\)-minimization problem in compressed sensing
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- An l₁-l_p DC regularization method for compressed sensing
Cited in
(48)- Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems
- Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Fast L1-L2 minimization via a proximal operator
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- A coordinate descent method for total variation minimization
- Support recovery of greedy block coordinate descent using the near orthogonality property
- Sparse group fused Lasso for model segmentation: a hybrid approach
- A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise
- Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding
- Nonnegative control of finite-dimensional linear systems
- Markov chain block coordinate descent
- An alternating maximization method for approximating the hump of the matrix exponential
- Heat source identification based on \(\ell_1\) constrained minimization
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing
- Parallel coordinate descent methods for big data optimization
- Block coordinate descent methods for semidefinite programming
- An adaptive Fourier filter for relaxing time stepping constraints for explicit solvers
- A network of spiking neurons for computing sparse representations in an energy-efficient way
- Generalized alternating projection for weighted-\(\ell_{2,1}\) minimization with applications to model-based compressive sensing
- Separable approximations and decomposition methods for the augmented Lagrangian
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
- Adaptive Randomized Coordinate Descent for Sparse Systems: Lasso and Greedy Algorithms
- A randomized nonmonotone block proximal gradient method for a class of structured nonlinear programming
- On the complexity of parallel coordinate descent
- First-order optimality condition of basis pursuit denoise problem
- On the complexity analysis of randomized block-coordinate descent methods
- A gradient based method for the \(L_{2}-L_{1/2}\) minimization and application to compressive sensing
- Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements
- Dictionary descent in optimization
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- A coordinate descent based method for geometry optimization of trusses
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- A time continuation based fast approximate algorithm for compressed sensing related optimization
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- A unified primal-dual algorithm framework based on Bregman iteration
- Adaptive penalty-based neurodynamic approach for nonsmooth interval-valued optimization problem
- A fast proximal point algorithm for \(\ell_{1}\)-minimization problem in compressed sensing
- Sparsity and L^1-optimal control for linear control systems
- Subspace methods for nonlinear optimization
- The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
- Regularised estimation for ARMAX process with measurements subject to outliers
- Numerical aspect of uniform ensemble controllability for linear systems
- GPU accelerated greedy algorithms for compressed sensing
This page was built for publication: Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268312)
