Pages that link to "Item:Q2268312"
From MaRDI portal
The following pages link to Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm (Q2268312):
Displaying 40 items.
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- First-order optimality condition of basis pursuit denoise problem (Q469076) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- Dictionary descent in optimization (Q519963) (← links)
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291) (← links)
- A coordinate descent based method for geometry optimization of trusses (Q543891) (← links)
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- A unified primal-dual algorithm framework based on Bregman iteration (Q639393) (← links)
- A fast proximal point algorithm for \(\ell_{1}\)-minimization problem in compressed sensing (Q670842) (← links)
- GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
- Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems (Q1691386) (← links)
- Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC) (Q1718121) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- Fast L1-L2 minimization via a proximal operator (Q1742664) (← links)
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (Q1749455) (← links)
- A coordinate descent method for total variation minimization (Q1992568) (← links)
- Support recovery of greedy block coordinate descent using the near orthogonality property (Q1992803) (← links)
- Sparse group fused Lasso for model segmentation: a hybrid approach (Q2051576) (← links)
- A variational method for Abel inversion tomography with mixed Poisson-Laplace-Gaussian noise (Q2158261) (← links)
- Nonnegative control of finite-dimensional linear systems (Q2226509) (← links)
- Markov chain block coordinate descent (Q2301127) (← links)
- An alternating maximization method for approximating the hump of the matrix exponential (Q2411640) (← links)
- Heat source identification based on \(\ell_1\) constrained minimization (Q2437931) (← links)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
- Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing'' (Q2511274) (← links)
- Block Coordinate Descent Methods for Semidefinite Programming (Q2802537) (← links)
- An Adaptive Fourier Filter for Relaxing Time Stepping Constraints for Explicit Solvers (Q2831193) (← links)
- A network of spiking neurons for computing sparse representations in an energy-efficient way (Q2840871) (← links)
- Generalized alternating projection for weighted-\(\ell_{2,1}\) minimization with applications to model-based compressive sensing (Q2876827) (← links)
- Separable approximations and decomposition methods for the augmented Lagrangian (Q2943840) (← links)
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
- Adaptive Randomized Coordinate Descent for Sparse Systems: Lasso and Greedy Algorithms (Q4580720) (← links)
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
- On the complexity of parallel coordinate descent (Q4638927) (← links)
- Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements (Q5014838) (← links)
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing (Q5271993) (← links)
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing (Q5356981) (← links)
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing (Q5453521) (← links)
- A time continuation based fast approximate algorithm for compressed sensing related optimization (Q5501146) (← links)
- Adaptive penalty-based neurodynamic approach for nonsmooth interval-valued optimization problem (Q6558462) (← links)
