We propose an adaptive refinement algorithm to solve total variation regularized measure optimization problems. The method iteratively constructs dyadic partitions of the unit cube based on (i) the resolution of discretized dual problems and (ii) the detection of cells containing points that violate...
Saved in:
| Main Authors: | Flinth, Axel, de Gournay, Frédéric, Weiss, Pierre |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Université de Montpellier
2025-03-01
|
| Series: | Open Journal of Mathematical Optimization |
| Subjects: | |
| Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.39/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Short Paper - A note on the Frank–Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
by: de Oliveira, Welington
Published: (2023-01-01) -
Regularized K-Means Clustering via Fully Corrective Frank-Wolfe Optimization
by: Ahmed Yacoub Yousif, et al.
Published: (2025-08-01) -
Projection-Free Methods for Online Distributed Quantized Optimization With Strongly Pseudoconvex Cost Functions
by: Xiaoxi Yan, et al.
Published: (2025-01-01) -
Obituary: Frank Ainsworth
by: Leon Fulcher
Published: (2024-11-01) -
La Internacional Comunista: cinco conferencias
by: Pierre Frank
Published: (2019-11-01)