Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
From MaRDI portal
Publication:1987437
DOI10.1016/j.cam.2020.112837OpenAlexW3012004192MaRDI QIDQ1987437
Publication date: 15 April 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2020.112837
nonconvex optimizationKurdyka-Łojasiewicz propertynonconvex regularizationnonsmooth objective functioninexact stopping conditioniteratively reweighted algorithm
Convex programming (90C25) 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)
Related Items
An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
- A block coordinate variable metric forward-backward algorithm
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Inexact accelerated augmented Lagrangian methods
- iPiasco: inertial proximal algorithm for strongly convex optimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On gradients of functions definable in o-minimal structures
- Proximal point methods and nonconvex optimization
- On semi- and subanalytic geometry
- Introductory lectures on convex optimization. A basic course.
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Approximate ADMM algorithms derived from Lagrangian splitting
- A first-order primal-dual algorithm for convex problems with applications to imaging
- An accelerated inexact proximal point algorithm for convex minimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- Online Learning and Online Convex Optimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- The Split Bregman Method for L1-Regularized Problems
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Clarke Subgradients of Stratifiable Functions
- New Proximal Point Algorithms for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
- An Inexact Proximal Path-Following Algorithm for Constrained Convex 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
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Signal Recovery by Proximal Forward-Backward Splitting
- Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
