Template:Optimization algorithms

v t e Optimization: Algorithms, methods, and heuristics
Methods calling functions	Golden section search Template:·w Interpolation methods Template:·w Line search Template:·w Successive parabolic interpolation
Methods calling gradients	Convergence (Trust region Template:·w Wolfe conditions)Template:·w Gauss–Newton Template:·w Gradient Template:·w Levenberg–Marquardt Template:·w Conjugate gradient Template:·w Quasi–Newton (BFGS Template:·w L-BFGS )
Methods calling Hessians	Newton's method Template:·w Sequential quadratic programming
Nonlinear programming	Barrier methods Template:·w Penalty methods Template:·w Augmented Lagrangian methods Template:·w Sequential quadratic programming Template:·w Successive linear programming
Convex minimization	Cutting-plane method Template:·w Interior point method Template:·w Reduced gradient (Frank–Wolfe)Template:·w Subgradient method Template:·w Semidefinite programming
Linear programming	Basis-exchange (Simplex algorithm of Dantzig Template:·w Criss-cross algorithm)Template:·w Interior point (Ellipsoid method of Khachiyan Template:·w Projective algorithm of Karmarkar)
Combinatorial algorithms	Approximation algorithm Template:·w Dynamic programming Template:·w Greedy algorithm Template:·w Integer programming (Branch & bound Template:·w Branch & cut Template:·w Branch & price)
Metaheuristics	Evolutionary algorithm Template:·w Hill climbing Template:·w Local search Template:·w Simulated annealing Template:·w Tabu search
Categories (Algorithms · Methods · Heuristics) · Software