On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization
From MaRDI portal
Publication:6042933
DOI10.1088/1361-6420/acca43MaRDI QIDQ6042933
Silvia Bonettini, Unnamed Author, Simone Rebegoldi, Marco Prato
Publication date: 4 May 2023
Published in: Inverse Problems (Search for Journal in Brave)
Cites Work
- Unnamed Item
- 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
- A block coordinate variable metric forward-backward algorithm
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- A scaled and adaptive FISTA algorithm for signal-dependent sparse image super-resolution problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Variable metric techniques for forward-backward methods in imaging
- 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
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Proximal Splitting Methods in Signal Processing
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Efficient gradient projection methods for edge-preserving removal of Poisson noise
- Two-Point Step Size Gradient Methods
- Variational Analysis
- Inexact spectral projected gradient methods on convex sets
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- 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
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Signal Recovery by Proximal Forward-Backward Splitting
This page was built for publication: On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization