A new globally convergent algorithm for non-Lipschitz _p-_q minimization
From MaRDI portal
Publication:2000528
ADMM (alternating direction method of multipliers)Gaussian noiseheavy-tailed noiselower bound theorynon-Lipschitz optimizationnonconvex nonsmooth regularizationsupport shrinking
Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Numerical methods based on necessary conditions (49M05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Recommendations
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz _p regularized matrix minimization
- An improved algorithm for the \(L_2-L_p\) minimization problem
- A globally convergent algorithm for a constrained non-Lipschitz image restoration model
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal
Cites work
- <inline-formula> <tex-math notation="LaTeX">$\ell _{p}$ </tex-math></inline-formula>-Regularized Least Squares <inline-formula> <tex-math notation="LaTeX">$(0<p<1)$ </tex-math></inline-formula>
- A cluster elastic net for multivariate regression
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A generalized Krylov subspace method for _p-_q minimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Clarke Subgradients of Stratifiable Functions
- Compressive Sensing Signal Reconstruction by Weighted Median Regression Estimates
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Geometric categories and o-minimal structures
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Least absolute value regression: recent contributions
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- On gradients of functions definable in o-minimal structures
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- One-step sparse estimates in nonconcave penalized likelihood models
- Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Regularization and Variable Selection Via the Elastic Net
- Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
- Robust Statistics
- Smoothing methods for nonsmooth, nonconvex minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Stability of the elastic net estimator
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- The Split Bregman Method for L1-Regularized Problems
- Variational Analysis
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
Cited in
(17)- Global optimality condition and fixed point continuation algorithm for non-Lipschitz _p regularized matrix minimization
- An improved algorithm for the \(L_2-L_p\) minimization problem
- An efficient and globally convergent algorithm for \(\ell_{p,q} - \ell_r\) model in group sparse optimization
- Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm
- Image retinex based on the nonconvex TV-type regularization
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
- Image restoration via the adaptive \(TV^p\) regularization
- Nonconvex piecewise-quadratic underestimation for global minimization
- Proximal linearization methods for Schatten p-quasi-norm minimization
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model
- A general non-Lipschitz infimal convolution regularized model: Lower bound theory and algorithm
- A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal
- An effective optimization algorithm for locally nonconvex Lipschitz functions based on mollifier subgradients
- Non-Lipschitz attack: a more sparse adversarial attack via non-Lipschitz _p regularization
- A general non-Lipschitz joint regularized model for multi-channel/modality image reconstruction
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
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)
