Algorithms - NEOS Guide

Algorithm with URL	Problems URLs
Augmented Lagrangian Methods	Constrained Optimization Nonlinear Programming
Broyden's Method	Unconstrained Optimization Nonlinear Optimization
Central Cutting Plane Methods	Constrained Optimization Semi-infinite Programming
Difference Approximations	Unconstrained Optimization
Discretization Methods	Constrained Optimization Semi-infinite Programming
Feasible Sequential Quadratic Programming	Constrained Optimization Nonlinear Programming
Gauss-Newton Method	Unconstrained Optimization Nonlinear Least-Squares Problems
Gradient Projection Methods	Constrained Optimization Bound Constrained Optimization
Homotopy Methods	Unconstrained Optimization Nonlinear Optimization
Hybrid Methods	Unconstrained Optimization Nonlinear Least-Squares Problems
Interior-Point Methods	Constrained Optimization Linear Programming
KKT Reduction Methods	Constrained Optimization Semi-infinite Programming
Levenberg-Marquardt Method	Unconstrained Optimization Nonlinear Least-Squares Problems
Line Search Methods	Unconstrained Optimization
Newton Methods	Constrained Optimization Bound Constrained Optimization
Nonlinear Conjugate Gradient Method	Unconstrained Optimization
Nonlinear Least Squares Problems with Constraints	Unconstrained Optimization Nonlinear Least-Squares Problems
Nonlinear Simplex Method	Unconstrained Optimization
Quadratic Programming	Constrained Optimization Quadratic Programming
Quasi-Newton Methods	Unconstrained Optimization
Reduced-Gradient Methods	Constrained Optimization Nonlinear Programming
Sequential Quadratic Programming	Constrained Optimization Nonlinear Programming
Simplex Method	Constrained Optimization Linear Programming
SQP Reduction Methods	Constrained Optimization Semi-infinite Programming
Tensor Methods	Unconstrained Optimization Nonlinear Optimization
Truncated Newton Methods	Unconstrained Optimization
Trust-Region and Line Search Methods	Unconstrained Optimization Nonlinear Optimization
Trust-Region Methods	Unconstrained Optimization