An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 05:49, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration	scientific article

Statements

scholarly article

0 references

An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (English)

0 references

0 references

0 references

0 references

Journal of Mathematical Imaging and Vision

0 references

publication date

5 February 2019

0 references

zbMATH Keywords

non-convex non-smooth optimization

0 references

non-Lipschitz optimization

0 references

lower bound theory

0 references

Kurdyka-Łojasiewicz property

0 references

total variation regularization

0 references

image restoration

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1007/s10851-018-0830-0

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Linearly Constrained Non-Lipschitz Optimization for Image Restoration

0 references

Iterative hard thresholding for compressed sensing

0 references

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

0 references

Clarke Subgradients of Stratifiable Functions

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Enhancing sparsity by reweighted \(\ell _{1}\) minimization

0 references

Restricted isometry properties and nonconvex compressive sensing

0 references

Atomic Decomposition by Basis Pursuit

0 references

Smoothing methods for nonsmooth, nonconvex minimization

0 references

Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration

0 references

Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization

0 references

Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization

0 references

Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization

0 references

Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization

0 references

Iteratively reweighted least squares minimization for sparse recovery

0 references

For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution

0 references

Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)

0 references

Sparse representations in unions of bases

0 references

Nonconvex TV$^q$-Models in Image Restoration: Analysis and a Trust-Region Regularization--Based Superlinearly Convergent Solver

0 references

On gradients of functions definable in o-minimal structures

0 references

An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems

0 references

Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization

0 references

Constrained TV\(_p\)-\(\ell_2\) model for image restoration

0 references

Global Convergence of Splitting Methods for Nonconvex Composite Optimization

0 references

0 references

Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming

0 references

Sparse Approximate Solutions to Linear Systems

0 references

A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions

0 references

Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares

0 references

Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction

0 references

Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization

0 references

On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision

0 references

Variational Analysis

0 references

Nonlinear total variation based noise removal algorithms

0 references

Joint image reconstruction and segmentation using the Potts model

0 references

Recovery of sparsest signals via \(\ell^q \)-minimization

0 references

Geometric categories and o-minimal structures

0 references

A New Alternating Minimization Algorithm for Total Variation Image Reconstruction

0 references

Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models

0 references

On the Edge Recovery Property of Noncovex Nonsmooth Regularization in Image Restoration

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S10851-018-0830-0

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1716780

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1716780&oldid=38714049"