NGSlv

From ASCEND

This article is a stub. You can help out by expanding it.

This article is missing some information. You can help out by finding it out and adding it.

A solver that Ken Tyner (which I can't locate) used to investigate a decomposition of the optimization problem to make it more robust. Probably not functional.

NLA
QRSlv
CMSlv
IPSlv
Opt
NLP
CONOPT
IPOPT
TRON
MINOS
NGSlv
OptSQP
DAE/ODE
IDA
LSODE
DOPRI5
LA
linsolqr
linsol
LP
MakeMPS
Logic
LRSlv