Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
From MaRDI portal
Publication:3617181
DOI10.1137/060663556zbMath1170.46067OpenAlexW1975490585WikidataQ57562043 ScholiaQ57562043MaRDI QIDQ3617181
Kristian Bredies, Dirk A. Lorenz
Publication date: 27 March 2009
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3dd454b78fc9bf73e03778f329b2b48ede4b52b7
convergence analysissparsity constraintsgeneralized conditional gradient methoditerated hard shrinkage
Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Programming in abstract spaces (90C48) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items
The Cyclic Block Conditional Gradient Method for Convex Optimization Problems, Non-convex sparse regularisation, Nonconvex flexible sparsity regularization: theory and monotone numerical schemes, Screening for a reweighted penalized conditional gradient method, Adaptive wavelet methods and sparsity reconstruction for inverse heat conduction problems, A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization, Asymptotic linear convergence of fully-corrective generalized conditional gradient methods, Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method, Relaxed-inertial proximal point type algorithms for quasiconvex minimization, Efficient regularization with wavelet sparsity constraints in photoacoustic tomography, Flexible sparse regularization, Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization, Convergence rates and source conditions for Tikhonov regularization with sparsity constraints, A projected gradient method for αℓ 1 − βℓ 2 sparsity regularization **, Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing, Modified algorithms for image inpainting in Fourier transform domain, Fast thresholding algorithms with feedbacks for sparse signal recovery, A Projection Proximal-Point Algorithm for ℓ1Minimization, A non-adapted sparse approximation of PDEs with stochastic inputs, Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression), Compressive wave computation, Sparsity of solutions for variational inverse problems with finite-dimensional data, A New Algorithm Framework for Image Inpainting in Transform Domain, An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space, Modified Landweber Iteration in Banach Spaces—Convergence and Convergence Rates, Iterative thresholding for sparse approximations, Linear convergence of iterative soft-thresholding, Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots, Conditional Gradient Sliding for Convex Optimization, Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization, Optimal convergence rates for Tikhonov regularization in Besov scales, Generalized Conditional Gradient for Sparse Estimation, Variable Metric Forward-Backward Algorithm for Composite Minimization Problems, A new algorithm for image inpainting in Fourier transform domain
