Skip to content
#

quadratic-programming

Here are 169 public repositories matching this topic...

A next-gen Lagrange-Newton solver for nonconvex constrained optimization. Unifies barrier and SQP methods in a generic way, and implements various globalization flavors (line search/trust region and merit function/filter method/funnel method). Competitive against filterSQP, IPOPT, SNOPT, MINOS and CONOPT.

  • Updated Dec 16, 2024
  • C++

Improve this page

Add a description, image, and links to the quadratic-programming topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the quadratic-programming topic, visit your repo's landing page and select "manage topics."

Learn more