An abstract convergence framework with application to inertial inexact forward-backward methods
From MaRDI portal
Publication:2696904
DOI10.1007/s10589-022-00441-4OpenAlexW4313353756MaRDI QIDQ2696904
Peter Ochs, Silvia Bonettini, Simone Rebegoldi, Marco Prato
Publication date: 17 April 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.07545
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Mathematical programming (90Cxx)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Fast first-order methods for composite convex optimization with backtracking
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- A block coordinate variable metric forward-backward algorithm
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- 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
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- New convergence results for the inexact variable metric forward-backward method
- Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization
- Accelerated and Inexact Forward-Backward Algorithms
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Proximal Splitting Methods in Signal Processing
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Clarke Subgradients of Stratifiable Functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Variational Analysis
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Insights Into Analysis Operator Learning: From Patch-Based Sparse Models to Higher Order MRFs
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano
- Optimization Methods for Large-Scale Machine Learning
- Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm
- Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope
- Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Signal Recovery by Proximal Forward-Backward Splitting
- Some methods of speeding up the convergence of iteration methods
- Convex Analysis
- An introduction to continuous optimization for imaging
- Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework
- Convex analysis and monotone operator theory in Hilbert spaces
- Structured sparsity through convex optimization
