A finite hyperplane traversal algorithm for 1-dimensional \(L^1pTV\) minimization, for \(0

DOI10.1007/S10589-015-9738-4zbMath1330.90108OpenAlexW188373354MaRDI QIDQ493699

Heather A. Moon, Thomas J. Asaki

Publication date: 4 September 2015

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-015-9738-4

zbMATH Keywords

scalesnonsmooth optimizationsignal processing

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

Anisotropic variation formulas for imaging applications

Cites Work

• Nonlinear total variation based noise removal algorithms
• Parametric Maximum Flow Algorithms for Fast Total Variation Minimization
• Edge-preserving and scale-dependent properties of total variation regularization
• Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
• Aspects of Total Variation RegularizedL¹Function Approximation
• Efficient Minimization Methods of Mixed l2-l1 and l1-l1 Norms for Image Restoration
• Direct methods in the calculus of variations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A finite hyperplane traversal algorithm for 1-dimensional \(L^1pTV\) minimization, for \(0<p\leq 1\)