Template:Optimization algorithms

From Vigyanwiki

Optimization algorithms

Revision as of 21:13, 24 February 2022 by wikipedia>Mo-Al

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Optimization: Algorithms, methods, and heuristics

Unconstrained nonlinear

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	Conjugate gradient Gauss–Newton Gradient Mirror Levenberg–Marquardt Powell's dog leg method Truncated Newton

Newton's method

Optimization computes maxima and minima.

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

Shortest path	Bellman–Ford SPFA Dijkstra Floyd–Warshall

Metaheuristics
Evolutionary algorithm Hill climbing Local search Simulated annealing Tabu search

Software

Lua error in Module:TNT at line 182: Missing Commons dataset I18n/Module:TNT.tab.

Retrieved from ‘https://www.vigyanwiki.in/index.php?title=Template:Optimization_algorithms&oldid=27746’

Hidden categories: