Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
DOI10.1137/19M1277552zbMath1468.90098arXiv1907.11486MaRDI QIDQ4989931
Publication date: 27 May 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.11486
nonsmooth optimizationinverse problemsnonconvex optimizationforward-backward algorithmproximity operatorcomposite minimization problemmajorize-minimize methodreweighting algorithm
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Approximation methods and heuristics in mathematical programming (90C59) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Decomposition methods (49M27) Approximation algorithms (68W25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A proximal method for composite minimization
- 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
- Proximity for sums of composite functions
- A block coordinate variable metric forward-backward algorithm
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the convergence properties of the EM algorithm
- Factoring wavelet transforms into lifting steps
- A Gauss-Newton method for convex composite optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
- Accelerated and Inexact Forward-Backward Algorithms
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- Convergence of an Inexact Algorithm for Composite Nonsmooth Optimization
- Clarke Subgradients of Stratifiable Functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
- On the global convergence of trust region algorithms for unconstrained minimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Descent methods for composite nondifferentiable optimization problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A model algorithm for composite nondifferentiable optimization problems
- Convergence Rates in Forward--Backward Splitting
- Variational Analysis
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A primal–dual hybrid gradient method for nonlinear operators with applications to MRI
- Relaxed Gauss--Newton Methods with Applications to Electrical Impedance Tomography
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Composite Optimization by Nonconvex Majorization-Minimization
- On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- First Order Algorithms in Variational Image Processing
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Signal Recovery by Proximal Forward-Backward Splitting
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Proximité et dualité dans un espace hilbertien
- Convex Analysis