:template:Optimization algorithms

{{Navbox with collapsible groups

| name = Optimization_algorithms

| title = Optimization: Algorithms, methods, and heuristics

| state = {{{state|uncollapsed}}}

| selected = {{{1|}}}

| bodyclass = hlist

| image = File:Max_paraboloid.svg

| group1 = Unconstrained nonlinear

| abbr1 = unconstrained

| state1 = {{#ifeq: {{{1|}}}|nonlinear|uncollapsed}}

| list1 =

{{Navbox|child

| group1 = Functions

| list1 =

• Golden-section search
• Powell's method
• Line search
• Nelder–Mead method
• Successive parabolic interpolation

| group2 = Gradients

| list2 =

{{Navbox|child

| group1 = Convergence

| list1 =

• Trust region
• Wolfe conditions

| group2 = Quasi–Newton

| list2 =

• Berndt–Hall–Hall–Hausman
• Broyden–Fletcher–Goldfarb–Shanno and L-BFGS
• Davidon–Fletcher–Powell
• Symmetric rank-one (SR1)

| group3 = Other methods

| list3 =

• Conjugate gradient
• Gauss–Newton
• Gradient
• Mirror
• Levenberg–Marquardt
• Powell's dog leg method
• Truncated Newton

}}

| group3 = Hessians

| list3 =

• Newton's method

}}

| group2 = Constrained nonlinear

| abbr2 = constrained

| state2 = {{#ifeq: {{{1|}}}|nonlinear|uncollapsed}}

| list2 =

{{Navbox|child

| group1 = General

| list1 =

• Barrier methods
• Penalty methods

| group2 = Differentiable

| list2 =

• Augmented Lagrangian methods
• Sequential quadratic programming
• Successive linear programming

}}

| group3 = Convex optimization

| abbr3 = convex

| list3 =

{{Navbox|child

| group1 = Convex
minimization

| list1 =

• Cutting-plane method
• Reduced gradient (Frank–Wolfe)
• Subgradient method

| group2 = Linear and
quadratic

| list2 =

{{Navbox|child

| evenodd = swap

| group1 = Interior point

| list1 =

• Affine scaling
• Ellipsoid algorithm of Khachiyan
• Projective algorithm of Karmarkar

| group2 = Basis-exchange

| list2 =

• Simplex algorithm of Dantzig
• Revised simplex algorithm
• Criss-cross algorithm
• Principal pivoting algorithm of Lemke
• Active-set method

}}

}}

| group4 = Combinatorial

| abbr4 = combinatorial

| list4 =

{{Navbox|child

| group1 = Paradigms

| list1 =

• Approximation algorithm
• Dynamic programming
• Greedy algorithm
• Integer programming
• Branch and bound/cut

| group2 = Graph
algorithms

| list2 =

{{Navbox|child

| evenodd = swap

| group1 = Minimum
spanning tree

| list1 =

• Borůvka
• Prim
• Kruskal

}}

{{Navbox|child

| evenodd = swap

| group1 = Shortest path

| list1 =

• Bellman–Ford
• SPFA
• Dijkstra
• Floyd–Warshall

}}

| group3 = Network flows

| list3 =

• Dinic
• Edmonds–Karp
• Ford–Fulkerson
• Push–relabel maximum flow

}}

| group5 = Metaheuristics

| abbr5 = heuristic

| list5 =

• Evolutionary algorithm
• Hill climbing
• Local search
• Parallel metaheuristics
• Simulated annealing
• Spiral optimization algorithm
• Tabu search

| below =

• Software

}}

{{documentation}}