A cyclic projected gradient method
type: Item
instance of: scholarly article
title: A cyclic projected gradient method
zbMATH Open document ID: 1269.90109
author: S. Setzer
author: Jan Morgenthaler
author: Gabriele Steidl
published in: Computational Optimization and Applications
publication date: 2013-04-15T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6154013
zbMATH Keywords: constrained optimization
zbMATH Keywords: projected gradient methods
zbMATH Keywords: fast explicit diffusion
zbMATH Keywords: image denoising
zbMATH Keywords: sparse recovery
describes a project that uses: SPGL1
describes a project that uses: L1TestPack
describes a project that uses: FPC_AS
MaRDI profile type: Publication
full work available at URL: s10589-012-9525-4
OpenAlex ID: W2079802541
cites work: Super-time-stepping acceleration of explicit schemes for parabolic problems
cites work: Two-Point Step Size Gradient Methods
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: On the Goldstein-Levitin-Polyak gradient projection method
cites work: Q3151174
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Algorithm 813
cites work: Inexact spectral projected gradient methods on convex sets
cites work: On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
cites work: The cyclic Barzilai-–Borwein method for unconstrained optimization
cites work: Compressed sensing
cites work: New adaptive stepsize selections in gradient methods
cites work: Q4172872
cites work: Convex programming in Hilbert space
cites work: A New Active Set Algorithm for Box Constrained Optimization
cites work: Ordering of the iterative parameters in the cyclical Chebyshev iterative method
cites work: Q5545684
cites work: Constructing Test Instances for Basis Pursuit Denoising
cites work: Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
cites work: Q3320132
cites work: Smooth minimization of non-smooth functions
cites work: Nonlinear total variation based noise removal algorithms
cites work: A note on the dual treatment of higher-order regularization functionals
cites work: Q4864293
cites work: Probing the Pareto Frontier for Basis Pursuit Solutions
cites work: A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
cites work: On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
cites work: Numerical stability of the cyclic Richardson iteration
cites work: Gradient methods with adaptive step-sizes
DOI: 10.1007/S10589-012-9525-4
description: scientific article; zbMATH DE number 6154013