Linearly constrained non-Lipschitz optimization for image restoration
From MaRDI portal
Recommendations
- A globally convergent algorithm for a constrained non-Lipschitz image restoration model
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- On _2 data fitting and modified nonconvex nonsmooth regularization for image recovery
- Nonconvex TV^q-models in image restoration: analysis and a trust-region regularization-based superlinearly convergent solver
Cites work
- A bilevel optimization approach for parameter learning in variational models
- A group bridge approach for variable selection
- A majorize-minimize subspace approach for _2-_0 image regularization
- A mesh-independence result for semismooth Newton methods.
- A multilevel algorithm for simultaneously denoising and deblurring images
- A new semiblind deconvolution approach for Fourier-based image restoration: an application in astronomy
- A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Asymptotics for Lasso-type estimators.
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- scientific article; zbMATH DE number 49594 (Why is no real title available?)
- scientific article; zbMATH DE number 3297745 (Why is no real title available?)
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Limiting aspects of nonconvex \({TV}^{\phi}\) models
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Nonconvex TV^q-models in image restoration: analysis and a trust-region regularization-based superlinearly convergent solver
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- Optimality conditions and a smoothing trust region Newton method for nonlipschitz optimization
- Optimization and nonsmooth analysis
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Restricted isometry properties and nonconvex compressive sensing
- Smoothing methods for nonsmooth, nonconvex minimization
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
Cited in
(56)- Nonmonotone and monotone active-set method for image restoration. I: Convergence analysis.
- A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- A general truncated regularization framework for contrast-preserving variational signal and image restoration: motivation and implementation
- On the discontinuity of images recovered by noncovex nonsmooth regularized isotropic models with box constraints
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
- Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
- An efficient gradient-free projection algorithm for constrained nonlinear equations and image restoration
- Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
- A globally convergent algorithm for a constrained non-Lipschitz image restoration model
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- On constrained optimization with nonconvex regularization
- Sparsity reconstruction using nonconvex TGpV-shearlet regularization and constrained projection
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
- Half-linear regularization for nonconvex image restoration models
- Newton method for \(\ell_0\)-regularized optimization
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Optimality conditions for the constrained \(L_p\)-regularization
- On the local and global minimizers of _0 gradient regularized model with box constraints for image restoration
- On the Edge Recovery Property of Noncovex Nonsmooth Regularization in Image Restoration
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model
- The lower bound of nonlocal gradient for non-convex and non-smooth image patches based regularization
- 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
- Smoothing quadratic regularization method for hemivariational inequalities
- Solving Quasi-Variational Inequalities for Image Restoration with Adaptive Constraint Sets
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
- Non-Lipschitz models for image restoration with impulse noise removal
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms
- Smoothing neural network for L₀ regularized optimization problem with general convex constraints
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- A nonconvex nonsmooth image prior based on the hyperbolic tangent function
- A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model
- First-order methods for convex optimization
- Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization
- Non-Lipschitz variational models and their iteratively reweighted least squares algorithms for image denoising on surfaces
- Convergence of Peaceman-Rachford splitting method with Bregman distance for three-block nonconvex nonseparable optimization
- An inexact regularized proximal Newton method without line search
- Two linear proximal Peaceman-Rachford splitting algorithms for nonconvex and nonsmooth nonseparable optimization
- Hessian barrier algorithms for non-convex conic optimization
- A two-step inertial Bregman alternating structure-adapted proximal gradient descent algorithm for nonconvex and nonsmooth problems
- A nonconvex non-Lipschitz regularization model with globally convergent algorithm for multiphase piecewise-smooth image segmentation with intensity inhomogeneities
- Non-Lipschitz attack: a more sparse adversarial attack via non-Lipschitz _p regularization
- Two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems
- A novel adaptive non-convex \(TV^{p, q}\) model in image restoration
- A nonconvex and nonsmooth model for deblurring images under Cauchy noise
- Convergence rate analysis of nonconvex nonmonotone descent methods under the Hölderian value proximity error bound condition
- Limited memory methods with improved symmetric rank-one updates and its applications on nonlinear image restoration
This page was built for publication: Linearly constrained non-Lipschitz optimization for image restoration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454492)
