C
constrained-optimization
Projects with this topic
-
A next-gen solver for nonconvex optimization. Uno is a Lagrange-Newton solver that unifies barrier and SQP methods in a modern and generic way, and implements different globalization flavors (line search/trust region and merit function/filter method/funnel method). Competitive against filterSQP, IPOPT, SNOPT, MINOS and CONOPT.
Updated