Global convergence of proximal iteratively reweighted algorithm
From MaRDI portal
Publication:1675580
DOI10.1007/s10898-017-0507-zzbMath1379.90039OpenAlexW2594413771MaRDI QIDQ1675580
Tao Sun, Hao Jiang, Li-Zhi Cheng
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0507-z
convergence analysisparallel splittingKurdyka-Łojasiewicz functionalternating updatingproximal iteratively reweighted algorithm
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm, A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model, An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems, Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems, Global optimization for non-convex programs via convex proximal point method, Bregman reweighted alternating minimization and its application to image deblurring, Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization, Sequence Convergence of Inexact Nonconvex and Nonsmooth Algorithms with More Realistic Assumptions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Introductory lectures on convex optimization. A basic course.
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- DC programming: overview.
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Clarke Subgradients of Stratifiable Functions
- Variational Analysis
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- 10.1162/153244303322753751
- On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Signal Recovery by Proximal Forward-Backward Splitting
