Pages that link to "Item:Q2859933"
From MaRDI portal
The following pages link to A Bregman iterative algorithm for solving \(l^1\) minimization problems (Q2859933):
Displaying 8 items.
- Bregman iterative model using the \(G\)-norm (Q403467) (← links)
- Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization (Q490274) (← links)
- Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization (Q2220748) (← links)
- A new spectral method for \(l_1\)-regularized minimization (Q2254769) (← links)
- Numerical aspects of the nonstationary modified linearized Bregman algorithm (Q2335665) (← links)
- A modified Bland's rule for solving \(l_1\) norm minimization (Q2752533) (← links)
- Application of a new accelerating Bregman iterative algorithm in the sparse least squares problems (Q3180944) (← links)
- Iterating Bregman Retractions (Q4441942) (← links)