https://github.com/1a7r0ch3/cp_pfdr_graph_d1
Cut-pursuit with preconditioned forward-Douglas-Rachford for regularization of classical functionals by graph total variation
https://github.com/1a7r0ch3/cp_pfdr_graph_d1
cut-pursuit fused-lasso graph proximal-algorithms total-variation
Last synced: 5 months ago
JSON representation
Cut-pursuit with preconditioned forward-Douglas-Rachford for regularization of classical functionals by graph total variation
- Host: GitHub
- URL: https://github.com/1a7r0ch3/cp_pfdr_graph_d1
- Owner: 1a7r0ch3
- Created: 2017-10-17T13:47:10.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2020-08-05T21:55:35.000Z (almost 6 years ago)
- Last Synced: 2025-05-13T14:51:52.889Z (about 1 year ago)
- Topics: cut-pursuit, fused-lasso, graph, proximal-algorithms, total-variation
- Size: 0 Bytes
- Stars: 17
- Watchers: 2
- Forks: 4
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Cut-Pursuit with Preconditioned Forward-Douglas–Rachford for Minimizing Graph Total Variation with Additional Nondifferentiable Terms
This repository is rendered obsolete by new C++ implementations, hierarchically organized in classes, optimized for speed and memory, fixing some bugs, and computing the splitting steps of cut-pursuit *in parallel along the components*.
* for the cut-pursuit algorithms: [parallel-cut-pursuit](https://gitlab.com/1a7r0ch3/parallel-cut-pursuit)
* for the preconditioned proximal splitting algorithms: [pcd-prox-split](https://gitlab.com/1a7r0ch3/pcd-prox-split)