There are 2 repositories under nonlinear-programming-algorithms 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.
MATLAB implementations of a variety of nonlinear programming algorithms.
A trust-region interior-point method for general nonlinear programing problems (GSoC 2017).
This repo collects results of nonlinear optimization solvers on standard benchmark problems
Nonlinear programming algorithms as the (un-)constrained minimization problems with the focus on their numerical expression using various programming languages.