A new globally convergent algorithm for non-Lipschitz _p-_q minimization

DOI10.1007/S10444-019-09668-YzbMATH Open1415.49022OpenAlexW2915006508MaRDI QIDQ2000528FDOQ2000528

Yanan Zhao, Zhifang Liu, Chunlin Wu

Publication date: 28 June 2019

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-019-09668-y

zbMATH Keywords

heavy-tailed noiselower bound theoryGaussian noisenon-Lipschitz optimizationsupport shrinkingADMM (alternating direction method of multipliers)nonconvex nonsmooth regularization

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Numerical methods based on necessary conditions (49M05)

Cites Work

• Title not available (Why is that?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Cluster Elastic Net for Multivariate Regression
• One-step sparse estimates in nonconcave penalized likelihood models
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Variational Analysis
• Regularization and Variable Selection Via the Elastic Net
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• Robust Statistics
• The Split Bregman Method for L1-Regularized Problems
• Smoothing methods for nonsmooth, nonconvex minimization
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Least absolute value regression: recent contributions
• Geometric categories and o-minimal structures
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• Clarke Subgradients of Stratifiable Functions
• Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
• On gradients of functions definable in o-minimal structures
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization
• Minimization of non-smooth, non-convex functionals by iterative thresholding
• Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
• Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
• A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization
• Stability of the elastic net estimator
• <inline-formula> <tex-math notation="LaTeX">$\ell _{p}$ </tex-math></inline-formula>-Regularized Least Squares <inline-formula> <tex-math notation="LaTeX">$(0&lt;p&lt;1)$ </tex-math></inline-formula> and Critical Path
• Compressive Sensing Signal Reconstruction by Weighted Median Regression Estimates

Cited In (13)

• Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
• Image restoration via the adaptive \(TV^p\) regularization
• Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
• Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm
• A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm
• Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization
• An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^*
• The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
• Image retinex based on the nonconvex TV-type regularization
• An effective optimization algorithm for locally nonconvex Lipschitz functions based on mollifier subgradients
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
• Nonconvex piecewise-quadratic underestimation for global minimization
• A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal

This page was built for publication: A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000528)