Code

1. NewtonCQK (available soon)
   Sequential and parallel semi-smooth Newton method for the Continuous Quadratic Knapsack (CQK) problem, with specialized implemetations for projecting onto Simplex and L1-ball.
   URL: https://github.com/pjssilva/NewtonCQK.jl

2. MDGP
   Multistart strategy to solve the Molecular Distance Geometry Problem (MDGP) with interval data.
   URL: https://github.com/leonardosecchin/MDGP

3. SimpleAL
   Simple safeguarded augmented Lagrangian method for solving nonlinear programming problems, including those with complementarity constraints.
   URL: https://github.com/leonardosecchin/SimpleAL

4. Scaled-Algencan
   Adaptation of Algencan 3.1.1, a safeguarded augmented Lagrangian solver written by E. Birgin and J.M. Martínez, which implements the additional option of scaling the final solution.
   URL: https://github.com/leonardosecchin/scaled-algencan