A block coordinate variable metric linesearch based proximal gradient method
type: Item
instance of: scholarly article
title: A block coordinate variable metric linesearch based proximal gradient method
zbMATH Open document ID: 1405.90123
published in: Computational Optimization and Applications
publication date: 2018-10-02T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 6946575
zbMATH Keywords: alternating optimization
zbMATH Keywords: proximal gradient methods
zbMATH Keywords: Kurdyka-Łojasiewicz inequality
author: S. Bonettini
author: M. Prato
author: Simone Rebegoldi
describes a project that uses: iPiano
describes a project that uses: UNLocBoX
describes a project that uses: SPIRAL
MaRDI profile type: Publication
full work available at URL: s10589-018-0011-5
OpenAlex ID: W2807074140
cites work: Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
cites work: Blind and Semi-Blind Deblurring of Natural Images
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
cites work: A novel blind-deconvolution method with an application to seismology
cites work: Image deblurring with Poisson data: from cells to galaxies
cites work: Q3151174
cites work: Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: Inexact block coordinate descent methods with application to non-negative matrix factorization
cites work: A new semiblind deconvolution approach for Fourier-based image restoration: an application in astronomy
cites work: Variable metric inexact line-search-based methods for nonsmooth optimization
cites work: On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
cites work: New convergence results for the scaled gradient projection method
cites work: A cyclic block coordinate descent method with generalized gradient projections
cites work: A scaled gradient projection method for constrained image deblurring
cites work: On the convergence of inexact block coordinate descent methods for constrained optimization
cites work: On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm''
cites work: A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation
cites work: Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
cites work: A block coordinate variable metric forward-backward algorithm
cites work: Proximal Splitting Methods in Signal Processing
cites work: A convergent least-squares regularized blind deconvolution approach
cites work: Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
cites work: Globally convergent block-coordinate techniques for unconstrained optimization
cites work: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
cites work: This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
cites work: Q3141900
cites work: On gradients of functions definable in o-minimal structures
cites work: A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.
cites work: Projected Gradient Methods for Nonnegative Matrix Factorization
cites work: Q5643297
cites work: Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
cites work: iPiano: inertial proximal algorithm for nonconvex optimization
cites work: On some steplength approaches for proximal algorithms
cites work: A convergent blind deconvolution method for post-adaptive-optics astronomical imaging
cites work: A unified convergence analysis of block successive minimization methods for nonsmooth optimization
cites work: Variational Analysis
cites work: Nonlinear total variation based noise removal algorithms
cites work: The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
cites work: Q4903682
cites work: Analysis of an approximate model for Poisson data reconstruction and a related discrepancy principle
cites work: Q4125663
cites work: A coordinate gradient descent method for nonsmooth separable minimization
cites work: Accelerated and inexact forward-backward algorithms
cites work: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
cites work: Q3149262
Wikidata QID: Q129701560
DOI: 10.1007/S10589-018-0011-5
description: scientific article; zbMATH DE number 6946575