The linearized alternating direction method of multipliers for Dantzig selector
From MaRDI portal
Publication:4903742
Recommendations
- An alternating direction method for finding Dantzig selectors
- A fast splitting method tailored for Dantzig selector
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- A partially proximal linearized alternating minimization method for finding Dantzig selectors
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models
Cited in
(69)- Linearized alternating direction method of multipliers for sparse group and fused Lasso models
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression
- An alternating direction method for finding Dantzig selectors
- A partially proximal linearized alternating minimization method for finding Dantzig selectors
- Selective linearization for multi-block statistical learning
- Sparse principal component regression via singular value decomposition approach
- ADMM-type methods for generalized multi-facility Weber problem
- A survey on some recent developments of alternating direction method of multipliers
- Convergence study on the proximal alternating direction method with larger step size
- Optimally linearizing the alternating direction method of multipliers for convex programming
- Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis
- A class of alternating linearization algorithms for nonsmooth convex optimization
- A modified primal-dual method with applications to some sparse recovery problems
- On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize
- Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step
- A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming
- A relaxed-PPA contraction method for sparse signal recovery
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem
- Iteration-complexity analysis of a generalized alternating direction method of multipliers
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- Partial error bound conditions and the linear convergence rate of the alternating direction method of multipliers
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- Inertial proximal ADMM for linearly constrained separable convex optimization
- An alternating direction method of multipliers with a worst-case \(O(1/n^2)\) convergence rate
- Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
- Block-wise alternating direction method of multipliers for multiple-block convex programming and beyond
- Discerning the linear convergence of ADMM for structured convex optimization through the lens of variational analysis
- The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization
- Efficient sparse Hessian-based semismooth Newton algorithms for Dantzig selector
- The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
- Comparison of several fast algorithms for projection onto an ellipsoid
- On the linear convergence of the alternating direction method of multipliers
- On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM
- An inexact Uzawa algorithmic framework for nonlinear saddle point problems with applications to elliptic optimal control problem
- Iteration complexity analysis of block coordinate descent methods
- The Dantzig selector for censored linear regression models
- The linearized alternating direction method of multipliers for low-rank and fused LASSO matrix regression model
- A golden ratio proximal alternating direction method of multipliers for separable convex optimization
- Hybrid Hard-Soft Screening for High-dimensional Latent Class Analysis
- Rate-optimal robust estimation of high-dimensional vector autoregressive models
- Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications
- An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression
- A unified precision matrix estimation framework via sparse column-wise inverse operator under weak sparsity
- A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems
- High-dimensional sparse single-index regression via Hilbert-Schmidt independence criterion
- On variable splitting and augmented Lagrangian method for total variation-related image restoration models
- A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression
- Nonconvex Dantzig selector and its parallel computing algorithm
- Multi-block relaxed-dual linear inertial ADMM algorithm for nonconvex and nonsmooth problems with nonseparable structures
- A new linearized alternating direction method of multipliers with adaptive step size and its inexact version for fused Lasso regression model
- Linearized alternating direction method of multipliers with adaptive stepsize
- Convergence analysis of the indefinite proximal augmented Lagrange method under strongly convex conditions
- A splitting preconditioned primal-dual algorithm with interpolation and extrapolation for bilinear saddle point problem
- Quasi-Newton L-BFGS based inexact primal-dual proximal point algorithms to solve nonsmooth convex composite programs for sparse signal recovery applications
- A linearized proximal ADMM for stochastic and large-scale convex optimization
- Feature splitting parallel algorithm for Dantzig selectors
- Proximal alternating direction method of multipliers with convex combination proximal centers
- A three-block linearized generalized ADMM based iterative algorithm for separable convex programming with application to an image compression problem
- A class of ADMM-based algorithms for three-block separable convex programming
- A step-free primal-dual algorithm for solving bilinear saddle point problem
- Alternating direction method of multipliers with difference of convex functions
- Robust penalized Dantzig selector: error analysis, oracle inequalities, and algorithmic efficiency
- A fast splitting method tailored for Dantzig selector
- On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities
- A proximal alternating linearization method for minimizing the sum of two convex functions
This page was built for publication: The linearized alternating direction method of multipliers for Dantzig selector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903742)
