Cover Image

Denoising Sphere-Valued Data by Relaxed Total Variation Regularization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Beinert, Robert, Bresch, Jonas
Format:	Preprint
Published:	2024
Subjects:	Numerical Analysis Optimization and Control 94A08, 94A12, 65J22, 90C22, 90C25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Denoising Hyperbolic-Valued Data by Relaxed Regularizations
by: Beinert, Robert, et al.
Published: (2024)

Denoising of Sphere- and SO(3)-Valued Data by Relaxed Tikhonov Regularization
by: Beinert, Robert, et al.
Published: (2023)

Denoising Multi-Color QR Codes and Stiefel-Valued Data by Relaxed Regularizations
by: Beinert, Robert, et al.
Published: (2025)

Variable Projected Augmented Lagrangian Methods for Generalized Lasso Problems
by: Aleotti, Stefano, et al.
Published: (2025)

Greedy Learning to Optimize with Convergence Guarantees
by: Fahy, Patrick, et al.
Published: (2024)

The Dantzig Selector: Sparse Signals Recovery via l_p-q Minimization
by: Li, Jie, et al.
Published: (2023)

Semi-Monotone Goldstein Line Search Strategy with Application in Sparse Recovery
by: Shabani, Shima, et al.
Published: (2025)

A distributed Douglas-Rachford splitting method for solving linear constrained multi-block weakly convex problems
by: Hu, Leyu, et al.
Published: (2024)

Reciprocal Convex Costs for Ratio Matching: Functional-Equation Characterization and Decision Geometry
by: Washburn, Jonathan, et al.
Published: (2026)

Bilevel Learning via Inexact Stochastic Gradient Descent
by: Salehi, Mohammad Sadegh, et al.
Published: (2025)

On the Hardness of the $L_1-L_2$ Regularization Problem
by: Ouyang, Yuyuan, et al.
Published: (2024)

A New Spectral Conjugate Subgradient Method with Application in Computed Tomography Image Reconstruction
by: Loreto, Milagros, et al.
Published: (2023)

A primal-dual algorithm for image reconstruction with input-convex neural network regularizers
by: Ehrhardt, Matthias J., et al.
Published: (2024)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

An inexact proximal MM method for a class of nonconvex composite image reconstruction models
by: Li, Bujin, et al.
Published: (2024)

Randomized block coordinate descent method for linear ill-posed problems
by: Jin, Qinian, et al.
Published: (2024)

Noisy phase retrieval from subgaussian measurements
by: Peng, Haiyang, et al.
Published: (2024)

Optimising two-block averaging kernels to speed up Markov chains
by: Lim, Ryan J. Y., et al.
Published: (2026)

On additive averaging kernels for finite Markov chains
by: Lim, Ryan J. Y., et al.
Published: (2026)

Dimension reduction, exact recovery, and error estimates for sparse reconstruction in phase space
by: Holler, Martin, et al.
Published: (2021)

Square Root LASSO: Well-posedness, Lipschitz stability and the tuning trade off
by: Berk, Aaron, et al.
Published: (2023)

Global convergence of the subgradient method for robust signal recovery
by: Cai, Zesheng, et al.
Published: (2026)

An accelerated preconditioned proximal gradient algorithm with a generalized Nesterov momentum for PET image reconstruction
by: Lin, Yizun, et al.
Published: (2024)

Alternating Subspace Method for Sparse Recovery of Signals
by: Zhu, Xu, et al.
Published: (2024)

A $\operatorname{prox}$-Based Semi-Smooth Newton Method for TV-Minimization
by: Bartels, Sören, et al.
Published: (2026)

Parallel subspace correction methods for semicoercive and nearly semicoercive convex optimization with applications to nonlinear PDEs
by: Lee, Young-Ju, et al.
Published: (2024)

The Coercive Projection Theorem for Canonical Reciprocal Costs
by: Washburn, Jonathan, et al.
Published: (2026)

Sparse Dictionary-Based Solution of Dynamic Inverse Problems
by: Mason-Mackay, Aidan, et al.
Published: (2026)

Information-theoretic minimax and submodular optimization algorithms for multivariate Markov chains
by: Lai, Zheyuan, et al.
Published: (2025)

Entropy-Guided Multiplicative Updates: KL Projections for Multi-Factor Target Exposures
by: Qiu, Yimeng
Published: (2025)

Improving the convergence of Markov chains via permutations and projections
by: Choi, Michael C. H., et al.
Published: (2024)

Solving exact and noisy rank-one tensor completion with semidefinite programming
by: Cifuentes, Diego, et al.
Published: (2025)

On generators of $k$-PSD closures of the positive semidefinite cone
by: Bhardwaj, Avinash, et al.
Published: (2024)

Nesterov's Accelerated Jacobi-Type Methods for Large-scale Symmetric Positive Semidefinite Linear Systems
by: Liang, Ling, et al.
Published: (2024)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
by: Kong, Weiwei
Published: (2022)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
by: Faybusovich, Leonid, et al.
Published: (2019)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)