Analysis of a variable metric block coordinate method under proximal errors

DOI10.1007/s11565-022-00456-zOpenAlexW4312222541MaRDI QIDQ6195234

Simone Rebegoldi

Publication date: 16 February 2024

Published in: Annali dell'Università di Ferrara. Sezione VII. Scienze Matematiche (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11565-022-00456-z

zbMATH Keywords

nonconvex optimizationproximal operatorvariable metricblock coordinate methods

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• 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
• Fixed point and Bregman iterative methods for matrix rank minimization
• A block coordinate variable metric forward-backward algorithm
• A block coordinate variable metric linesearch based proximal gradient method
• 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
• Efficient block coordinate methods for blind Cauchy denoising
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• Inexact successive quadratic approximation for regularized optimization
• New convergence results for the inexact variable metric forward-backward method
• Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• Inexact block coordinate descent methods with application to non-negative matrix factorization
• Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
• A scaled gradient projection method for constrained image deblurring
• Two-Point Step Size Gradient Methods
• Globally convergent block-coordinate techniques for unconstrained optimization
• Variational Analysis
• Inexact spectral projected gradient methods on convex sets
• Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano
• Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
• Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
• Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope
• On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
• On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
• Signal Recovery by Proximal Forward-Backward Splitting
• On search directions for minimization algorithms
• A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.
• Structured sparsity through convex optimization

This page was built for publication: Analysis of a variable metric block coordinate method under proximal errors