Yall1

swMATH10961MaRDI QIDQ22913FDOQ22913

Author name not available (Why is that?)

Cited In (66)

• Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
• Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
• A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
• An alternating direction method of multipliers for elliptic equation constrained optimization problem
• Compressed sensing in the spherical near-field to far-field transformation
• Sparse signal inversion with impulsive noise by dual spectral projected gradient method
• A family of second-order methods for convex \(\ell _1\)-regularized optimization
• Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Reducing effects of bad data using variance based joint sparsity recovery
• On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems
• Block Coordinate Descent Methods for Semidefinite Programming
• Allocation Strategies for High Fidelity Models in the Multifidelity Regime
• Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
• Typical reconstruction limits for distributed compressed sensing based on ℓ_2,1-norm minimization and Bayesian optimal reconstruction
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Penalized and constrained LAD estimation in fixed and high dimension
• Self-calibration and biconvex compressive sensing
• Fast algorithms for sparse inverse covariance estimation
• Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
• A modulus-based iterative method for sparse signal recovery
• Alternating direction method of multipliers with difference of convex functions
• Sequential sparse Bayesian learning with applications to system identification for damage assessment and recursive reconstruction of image sequences
• Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
• An efficient denoising framework using weighted overlapping group sparsity
• Image inpainting using reproducing kernel Hilbert space and Heaviside functions
• A modified alternating projection based prediction-correction method for structured variational inequalities
• A perfect reconstruction property for PDE-constrained total-variation minimization with application in Quantitative Susceptibility Mapping
• A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
• Adaptive graph construction using data self-representativeness for pattern classification
• Proximal methods for the latent group lasso penalty
• An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
• A fast patch-dictionary method for whole image recovery
• The restricted isometry property for random block diagonal matrices
• Sparse topical analysis of dyadic data using matrix tri-factorization
• Split Bregman algorithms for sparse group lasso with application to MRI reconstruction
• Split Bregman algorithms for multiple measurement vector problem
• A sheared low-rank model for oblique stripe removal
• A unified approach for minimizing composite norms
• Proximal gradient method with automatic selection of the parameter by automatic differentiation
• Stochastic Collocation vial₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
• Enhanced joint sparsity via iterative support detection
• A proximal alternating linearization method for minimizing the sum of two convex functions
• Orthogonal self-guided similarity preserving projection for classification and clustering
• A survey on compressive sensing: classical results and recent advancements
• On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
• The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
• An alternating direction and projection algorithm for structure-enforced matrix factorization
• Image restoration using total variation with overlapping group sparsity
• On the convergence analysis of the alternating direction method of multipliers with three blocks
• Generalized Conjugate Gradient Methods for ℓ₁ Regularized Convex Quadratic Programming with Finite Convergence
• Linear reconstruction measure steered nearest neighbor classification framework
• Erasure recovery matrices for encoder protection
• Group sparse recovery in impulsive noise via alternating direction method of multipliers
• A perturbation analysis of nonconvex block-sparse compressed sensing
• Fast first-order methods for composite convex optimization with backtracking
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• Simultaneous image fusion and denoising by using fractional-order gradient information
• Typical reconstruction performance for distributed compressed sensing based on ℓ_2,1-norm regularized least square and Bayesian optimal reconstruction: influences of noise
• Efficient Deterministic Compressed Sensing for Images with Chirps and Reed–Muller Codes
• Safe feature screening rules for the regularized Huber regression
• Adaptive surface-related multiple subtraction using sparse norm minimization method
• An Efficient Algorithm for Minimizing Multi Non-Smooth Component Functions
• Iteratively Reweighted Group Lasso Based on Log-Composite Regularization

This page was built for software: Yall1