Linear convergence analysis of the use of gradient projection methods on total variation problems
type: Item
instance of: scholarly article
title: Linear convergence analysis of the use of gradient projection methods on total variation problems
zbMATH Open document ID: 1290.90070
author: Pengwen Chen
author: Changfeng Gui
published in: Computational Optimization and Applications
publication date: 2013-04-15T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6154017
zbMATH Keywords: total variation
zbMATH Keywords: gradient projection methods
zbMATH Keywords: non-degeneracy conditions
zbMATH Keywords: linear convergence
zbMATH Keywords: projected gradients
MaRDI profile type: Publication
full work available at URL: s10589-011-9412-4
OpenAlex ID: W2007192621
cites work: Some first-order algorithms for total variation based image restoration
cites work: Two-Point Step Size Gradient Methods
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: Convergence of an Iterative Method for Total Variation Denoising
cites work: Projected gradient methods for linearly constrained problems
cites work: An algorithm for total variation minimization and applications
cites work: On the Convergence of the Lagged Diffusivity Fixed Point Method in Total Variation Image Restoration
cites work: Active contours without edges
cites work: A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
cites work: Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
cites work: \(R\)-linear convergence of the Barzilai and Borwein gradient method
cites work: The cyclic Barzilai-–Borwein method for unconstrained optimization
cites work: On the convergence of projected gradient processes to singular critical points
cites work: Q3134551
cites work: Gradient Method with Retards and Generalizations
cites work: Projection methods for variational inequalities with application to the traffic assignment problem
cites work: Convex programming in Hilbert space
cites work: The Split Bregman Method for L1-Regularized Problems
cites work: Q5576518
cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Nonlinear total variation based noise removal algorithms
cites work: A multiphase level set framework for image segmentation using the Mumford and Shah model
cites work: Iterative Methods for Total Variation Denoising
cites work: Fast, robust total variation-based reconstruction of noisy, blurred images
cites work: Identifiable Surfaces in Constrained Optimization
cites work: On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
cites work: Q5678788
DOI: 10.1007/S10589-011-9412-4
description: scientific article; zbMATH DE number 6154017