Template:Optimization algorithms

From HandWiki

Optimization: Algorithms, methods, and heuristics

Unconstrained nonlinear

… and gradients

Convergence	Trust region Wolfe conditions
Quasi–Newton	Berndt–Hall–Hall–Hausman Broyden–Fletcher–Goldfarb–Shanno and L-BFGS Davidon–Fletcher–Powell Symmetric rank-one (SR1)
Other methods	Gauss–Newton Gradient Levenberg–Marquardt Conjugate gradient Truncated Newton

… and Hessians

Newton's method

Graph of a strictly concave quadratic function with unique maximum.

Constrained nonlinear

General	Barrier methods Penalty methods
Differentiable	Augmented Lagrangian methods Sequential quadratic programming Successive linear programming

Convex optimization

Convex
minimization

Linear and
quadratic

Interior point	Affine scaling Ellipsoid algorithm of Khachiyan Projective algorithm of Karmarkar
Basis-exchange	Simplex algorithm of Dantzig Revised simplex algorithm Criss-cross algorithm Principal pivoting algorithm of Lemke

Paradigms

Graph
algorithms

Minimum spanning tree	Borůvka Prim Kruskal

Ford–Fulkerson

Push–relabel maximum flow

Metaheuristics
Evolutionary algorithm Hill climbing Local search Simulated annealing Tabu search

Software

Template documentation[create]

Editors can experiment in this template's sandbox and testcases pages.
Please add categories to the /doc subpage. Subpages of this template.

Retrieved from "https://handwiki.org/wiki/index.php?title=Template:Optimization_algorithms&oldid=5742"