pylat/adaptive-proximal-algorithms

A Julia package for adaptive proximal gradient and primal-dual algorithms

28
/ 100
Experimental

This is a Julia package designed for researchers and practitioners working with convex optimization problems, particularly those involving large datasets or complex models. It provides adaptive proximal gradient and primal-dual algorithms that can efficiently solve these problems. You input your specific convex optimization problem, and it outputs an optimized solution along with performance plots.

No commits in the last 6 months.

Use this if you are a researcher or a quantitative analyst who needs to solve convex optimization problems efficiently, especially when dealing with non-smooth functions or large-scale data where standard methods are too slow.

Not ideal if you are looking for a general-purpose optimization library for simple problems or if you are not familiar with convex optimization theory.

convex-optimization mathematical-programming machine-learning-research signal-processing numerical-analysis
No License Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 5 / 25
Maturity 8 / 25
Community 15 / 25

How are scores calculated?

Stars

11

Forks

4

Language

Julia

License

Last pushed

Jan 18, 2024

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/pylat/adaptive-proximal-algorithms"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.