A block coordinate variable metric linesearch based proximal gradient method
From MaRDI portal
Publication:1790669
DOI10.1007/s10589-018-0011-5zbMath1405.90123OpenAlexW2807074140WikidataQ129701560 ScholiaQ129701560MaRDI QIDQ1790669
Simone Rebegoldi, Marco Prato, Silvia Bonettini
Publication date: 2 October 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-018-0011-5
Related Items
Block delayed Majorize-Minimize subspace algorithm for large scale image restoration * ⋮ New convergence results for the inexact variable metric forward-backward method ⋮ The convergence properties of infeasible inexact proximal alternating linearized minimization ⋮ Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems ⋮ 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 ⋮ An abstract convergence framework with application to inertial inexact forward-backward methods ⋮ Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope ⋮ On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- On some steplength approaches for proximal algorithms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- A block coordinate variable metric forward-backward algorithm
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- A coordinate gradient descent method for nonsmooth separable minimization
- On gradients of functions definable in o-minimal structures
- A convergent least-squares regularized blind deconvolution approach
- Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
- A cyclic block coordinate descent method with generalized gradient projections
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- On the convergence of inexact block coordinate descent methods for constrained optimization
- Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- A convergent blind deconvolution method for post-adaptive-optics astronomical imaging
- Accelerated and Inexact Forward-Backward Algorithms
- A New Semiblind Deconvolution Approach for Fourier-Based Image Restoration: An Application in Astronomy
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Proximal Splitting Methods in Signal Processing
- Inexact block coordinate descent methods with application to non-negative matrix factorization
- Analysis of an approximate model for Poisson data reconstruction and a related discrepancy principle
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- New convergence results for the scaled gradient projection method
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- A scaled gradient projection method for constrained image deblurring
- Image deblurring with Poisson data: from cells to galaxies
- A novel blind-deconvolution method with an application to seismology
- Globally convergent block-coordinate techniques for unconstrained optimization
- Variational Analysis
- A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Blind and Semi-Blind Deblurring of Natural Images
- This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
- Projected Gradient Methods for Nonnegative Matrix Factorization
- 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.
This page was built for publication: A block coordinate variable metric linesearch based proximal gradient method
