JinraeKim/ParametrisedConvexApproximators.jl

A Julia package for parameterized convex approximators including parameterized log-sum-exp (PLSE) network.

35
/ 100
Emerging

This is a Julia package for researchers and practitioners working with optimization problems, especially those that involve making decisions under varying conditions. It allows you to build and train specialized neural networks called 'parameterized convex approximators.' You input data about your problem's conditions and decision variables, and it outputs an approximation of a convex function and, crucially, a way to quickly find the best decision for any given condition.

Use this if you need to rapidly solve many similar optimization problems where the optimal decision changes based on some input parameters, especially for amortized optimization or learning-based parametric optimization.

Not ideal if your optimization problem is not convex or if you only need to solve a single, static optimization problem rather than a parameterized one.

optimization decision-making parametric optimization convex analysis machine learning
No Package No Dependents
Maintenance 6 / 25
Adoption 5 / 25
Maturity 16 / 25
Community 8 / 25

How are scores calculated?

Stars

9

Forks

1

Language

Julia

License

MIT

Last pushed

Jan 07, 2026

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/JinraeKim/ParametrisedConvexApproximators.jl"

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