Global convergence of proximal iteratively reweighted algorithm
type: Item
instance of: scholarly article
title: Global convergence of proximal iteratively reweighted algorithm
zbMATH Open document ID: 1379.90039
author: Tao Sun
author: Hao Jiang
author: Li-zhi Cheng
published in: Journal of Global Optimization
publication date: 2017-11-02T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 47N10
zbMATH DE Number: 6802516
zbMATH Keywords: proximal iteratively reweighted algorithm
zbMATH Keywords: Kurdyka-Łojasiewicz function
zbMATH Keywords: convergence analysis
zbMATH Keywords: parallel splitting
zbMATH Keywords: alternating updating
describes a project that uses: FPC_AS
describes a project that uses: iPiano
MaRDI profile type: Publication
full work available at URL: s10898-017-0507-z
OpenAlex ID: W2594413771
cites work: Complexity of unconstrained \(L_2 - L_p\) minimization
cites work: Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
cites work: iPiano: inertial proximal algorithm for nonconvex optimization
cites work: DC programming: overview.
cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
cites work: Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
cites work: Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
cites work: 10.1162/153244303322753751
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
cites work: Variational Analysis
cites work: Q4235027
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Q5643297
cites work: On gradients of functions definable in o-minimal structures
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
cites work: Clarke Subgradients of Stratifiable Functions
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
DOI: 10.1007/S10898-017-0507-Z
description: scientific article; zbMATH DE number 6802516