A block coordinate variable metric linesearch based proximal gradient method
From MaRDI portal
Recommendations
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- On the convergence of block coordinate descent type methods
- A block coordinate variable metric forward-backward algorithm
- Variable metric inexact line-search-based methods for nonsmooth optimization
- A cyclic block coordinate descent method with generalized gradient projections
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A block coordinate variable metric forward-backward algorithm
- A convergent blind deconvolution method for post-adaptive-optics astronomical imaging
- A convergent least-squares regularized blind deconvolution approach
- A coordinate gradient descent method for nonsmooth separable minimization
- A cyclic block coordinate descent method with generalized gradient projections
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.
- A new semiblind deconvolution approach for Fourier-based image restoration: an application in astronomy
- A novel blind-deconvolution method with an application to seismology
- A scaled gradient projection method for constrained image deblurring
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Accelerated and inexact forward-backward algorithms
- Analysis of an approximate model for Poisson data reconstruction and a related discrepancy principle
- Blind and Semi-Blind Deblurring of Natural Images
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
- Globally convergent block-coordinate techniques for unconstrained optimization
- Image deblurring with Poisson data: from cells to galaxies
- Inexact and accelerated proximal point algorithms
- Inexact block coordinate descent methods with application to non-negative matrix factorization
- New convergence results for the scaled gradient projection method
- Nonlinear total variation based noise removal algorithms
- On gradients of functions definable in o-minimal structures
- On some steplength approaches for proximal algorithms
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- On the convergence of inexact block coordinate descent methods for constrained optimization
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal splitting methods in signal processing
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Variable metric inexact line-search-based methods for nonsmooth optimization
- Variational Analysis
- iPiano: inertial proximal algorithm for nonconvex optimization
Cited in
(12)- An abstract convergence framework with application to inertial inexact forward-backward methods
- Block delayed Majorize-Minimize subspace algorithm for large scale image restoration *
- On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms
- The convergence properties of infeasible inexact proximal alternating linearized minimization
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- New convergence results for the inexact variable metric forward-backward method
- A block coordinate variable metric forward-backward algorithm
- Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis
- Analysis of a variable metric block coordinate method under proximal errors
- Stochastic primal-dual hybrid gradient algorithm with adaptive step sizes
- Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems
This page was built for publication: A block coordinate variable metric linesearch based proximal gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790669)
