Open-L2O: A Comprehensive and Reproducible Benchmark for Learning to Optimize Algorithms
-
Updated
Jun 9, 2023 - C++
Open-L2O: A Comprehensive and Reproducible Benchmark for Learning to Optimize Algorithms
A next-gen solver for optimization with nonconvex objective and constraints. Reimplements filterSQP and IPOPT (barrier) in a modern and generic way, and unlocks a variety of novel methods. Competitive against filterSQP, IPOPT, SNOPT, MINOS and CONOPT.
Semi-random funky stuff, mainly for my PhD experiments and articles. Contains calculations and algorithm implementations for various applied mathematics and astrophysics articles I worked on.
Fix and Bound: An efficient approach for solving large-scale BoxQPs
Add a description, image, and links to the nonconvex-optimization topic page so that developers can more easily learn about it.
To associate your repository with the nonconvex-optimization topic, visit your repo's landing page and select "manage topics."