Template:Optimization algorithms

v t e Optimization algorithms
No derivatives available	Branch and bound Template:·w Nelder–Mead method Template:·w Powell's method Template:·w Rosenbrock methods
Gradient-based algorithms	BFGS Template:·w DFP Template:·w Gauss-Newton Template:·w Gradient descent Template:·w L-BFGS Template:·w Levenberg–Marquardt Template:·w Nonlinear CG Template:·w SR1
Hessian-based algorithms	Levenberg–Marquardt Template:·w Newton's method
Linear programming	Big M Template:·w Branch and cut Template:·w Delayed column generation Template:·w Interior point method Template:·w Karmarkar's algorithm Template:·w Simplex algorithm
Quadratic programming	Frank–Wolfe algorithm Template:·w Sequential Minimal Optimization
Heuristic algorithms	Extremal optimization Template:·w Great Deluge algorithm Template:·w Guided Local Search Template:·w Harmony search Template:·w Hill climbing Template:·w LUS Template:·w PSO Template:·w QA Template:·w RSO Template:·w Simulated annealing Template:·w Tabu search
Evolutionary algorithms	ABC Template:·w Bees algorithm Template:·w CMA-ES Template:·w Cuckoo search Template:·w DE Template:·w Firefly Template:·w GA Template:·w GSO Template:·w SI
Other	Cutting-plane method Template:·w EM algorithm Template:·w Fourier–Motzkin elimination Template:·w Golden section search Template:·w Successive parabolic interpolation