A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
type: Item
instance of: scholarly article
title: A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
zbMATH Open document ID: 1415.49022
author: Chunlin Wu
author: Yanan Zhao
author: Zhifang Liu
published in: Advances in Computational Mathematics
publication date: 2019-06-28T00:00:00Z
Mathematics Subject Classification ID: 49M05
Mathematics Subject Classification ID: 49K30
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 94A12
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7074898
zbMATH Keywords: nonconvex nonsmooth regularization
zbMATH Keywords: non-Lipschitz optimization
zbMATH Keywords: support shrinking
zbMATH Keywords: lower bound theory
zbMATH Keywords: ADMM (alternating direction method of multipliers)
zbMATH Keywords: Gaussian noise
zbMATH Keywords: heavy-tailed noise
MaRDI profile type: Publication
full work available at URL: s10444-019-09668-y
OpenAlex ID: W2915006508
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
cites work: Clarke Subgradients of Stratifiable Functions
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Minimization of non-smooth, non-convex functionals by iterative thresholding
cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Smoothing methods for nonsmooth, nonconvex minimization
cites work: Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization
cites work: Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
cites work: Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Least absolute value regression: recent contributions
cites work: A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
cites work: Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
cites work: The Split Bregman Method for L1-Regularized Problems
cites work: On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
cites work: Robust Statistics
cites work: On gradients of functions definable in o-minimal structures
cites work: An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
cites work: Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
cites work: A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization
cites work: Q5643297
cites work: Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
cites work: Compressive Sensing Signal Reconstruction by Weighted Median Regression Estimates
cites work: A Cluster Elastic Net for Multivariate Regression
cites work: Variational Analysis
cites work: Stability of the elastic net estimator
cites work: Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
cites work: Recovery of sparsest signals via \(\ell^q \)-minimization
cites work: Geometric categories and o-minimal structures
cites work: Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
cites work: $\ell _{p}$ -Regularized Least Squares $(0&lt;p&lt;1)$
cites work: Regularization and Variable Selection Via the Elastic Net
cites work: One-step sparse estimates in nonconcave penalized likelihood models
DOI: 10.1007/S10444-019-09668-Y
description: scientific article; zbMATH DE number 7074898