Convex Optimization Primal Dual Solver
Project description
Optimus Primal
A light weight proximal splitting Forward Backward Primal Dual based solver for convex optimization problems.
The current version supports finding the minimum of f(x) + h(A x) + p(B x) + g(x), where f, h, and p are lower semi continuous and have proximal operators, and g is differentiable. A and B are linear operators.
To learn more about proximal operators and algorithms, visit proximity operator repository. We suggest that users read the tutorial G. Chierchia, E. Chouzenoux, P. L. Combettes, and J.-C. Pesquet. "The Proximity Operator Repository. User's guide".
Requirements
- Python >= 3.8
- PyWavelets
- Numpy
- Scipy
Optional
- Matplotlib (only for examples)
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
optimusprimal-0.0.1.tar.gz
(10.3 kB
view hashes)
Built Distribution
Close
Hashes for optimusprimal-0.0.1-py2-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | c396dd8f7efecf86037a870f2e9e26ef25f00342c5cfc216b98aa9369c63d47d |
|
MD5 | 501619d64981c29126946ab5dc4c16cb |
|
BLAKE2b-256 | 97b2677250510a80ca0a17895dc2a0cc8de6bcf7ac8f470bdace75d1ae9f2b28 |