https://github.com/zevwoodstock/asyncprox
Asynchronous implementation of a Projective Splitting algorithm in Julia
https://github.com/zevwoodstock/asyncprox
asynchronous julia nonsmooth-optimization projective-splitting proximal-algorithms proximal-operators
Last synced: 3 months ago
JSON representation
Asynchronous implementation of a Projective Splitting algorithm in Julia
- Host: GitHub
- URL: https://github.com/zevwoodstock/asyncprox
- Owner: zevwoodstock
- Created: 2022-05-03T08:20:11.000Z (about 3 years ago)
- Default Branch: main
- Last Pushed: 2025-02-26T19:38:14.000Z (3 months ago)
- Last Synced: 2025-02-26T20:31:43.574Z (3 months ago)
- Topics: asynchronous, julia, nonsmooth-optimization, projective-splitting, proximal-algorithms, proximal-operators
- Language: Julia
- Homepage:
- Size: 3.88 MB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
This repository contains the code used to produce the results in "A note on asynchronous Projective Splitting in Julia" by Utkarsh Sharma, Kashish Goel, Aryan Dua, Sebastian Pokutta, and Zev
Woodstock [(preprint)](https://zevwoodstock.github.io/media/publications/asyncprox.pdf).
The subdirectories detail specific experiments on image processing and machine learning (further detailed in the article). The underlying optimisation algorithm used is the 2018 algorithm by Combettes and Eckstein. Instructions to change the algorithm to run it for a different problem are mentioned [(here)](https://github.com/zevwoodstock/AsyncProx/tree/main/Group%20Sparse%20Binary%20Distributed#using-the-library-to-run-a-different-problem).