A block coordinate variable metric linesearch based proximal gradient method (Q1790669)

scientific article; zbMATH DE number 6946575

Language	Label	Description	Also known as
English	A block coordinate variable metric linesearch based proximal gradient method	scientific article; zbMATH DE number 6946575

Statements

instance of

scholarly article

0 references

title

A block coordinate variable metric linesearch based proximal gradient method (English)

0 references

published in

Computational Optimization and Applications

0 references

publication date

2 October 2018

0 references

zbMATH Keywords

alternating optimization

0 references

proximal gradient methods

0 references

Kurdyka-Łojasiewicz inequality

0 references

0 references

0 references

0 references

describes a project that uses

0 references

0 references

0 references

0 references

full work available at URL

https://doi.org/10.1007/s10589-018-0011-5

0 references

cites work

Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences

0 references

Blind and Semi-Blind Deblurring of Natural Images

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

0 references

A novel blind-deconvolution method with an application to seismology

0 references

Image deblurring with Poisson data: from cells to galaxies

0 references

Q3151174

0 references

Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Inexact block coordinate descent methods with application to non-negative matrix factorization

0 references

A new semiblind deconvolution approach for Fourier-based image restoration: an application in astronomy

0 references

Variable metric inexact line-search-based methods for nonsmooth optimization

0 references

On the convergence of a linesearch based proximal-gradient method for nonconvex optimization

0 references

New convergence results for the scaled gradient projection method

0 references

A cyclic block coordinate descent method with generalized gradient projections

0 references

A scaled gradient projection method for constrained image deblurring

0 references

On the convergence of inexact block coordinate descent methods for constrained optimization

0 references

On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm''

0 references

A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation

0 references

Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function

0 references

A block coordinate variable metric forward-backward algorithm

0 references

Proximal Splitting Methods in Signal Processing

0 references

A convergent least-squares regularized blind deconvolution approach

0 references

Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates

0 references

Globally convergent block-coordinate techniques for unconstrained optimization

0 references

On the convergence of the block nonlinear Gauss-Seidel method under convex constraints

0 references

This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice

0 references

Q3141900

0 references

On gradients of functions definable in o-minimal structures

0 references

A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.

0 references

Projected Gradient Methods for Nonnegative Matrix Factorization

0 references

Q5643297

0 references

Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality

0 references

iPiano: inertial proximal algorithm for nonconvex optimization

0 references

On some steplength approaches for proximal algorithms

0 references

A convergent blind deconvolution method for post-adaptive-optics astronomical imaging

0 references

A unified convergence analysis of block successive minimization methods for nonsmooth optimization

0 references

Variational Analysis

0 references

Nonlinear total variation based noise removal algorithms

0 references

The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions

0 references

Q4903682

0 references

Analysis of an approximate model for Poisson data reconstruction and a related discrepancy principle

0 references

Q4125663

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

Accelerated and inexact forward-backward algorithms

0 references

A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion

0 references

Q3149262

0 references

Identifiers

zbMATH Open document ID

1405.90123

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S10589-018-0011-5

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1790669