defzone.net@gmail.comLiên hệ
DZ
DefZone.Net

Kien thuc cong nghe & giai tri

Bai vietDia diemAlbum anhGameCua hang
  1. Home
  2. Wiki
  • v
  • t
  • e
Optimization: Algorithms, methods, and heuristics
Unconstrained nonlinear
Functions
  • Golden-section search
  • Powell's method
  • Line search
  • Nelder–Mead method
  • Successive parabolic interpolation
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
  • Conjugate gradient
  • Gauss–Newton
  • Gradient
  • Mirror
  • Levenberg–Marquardt
  • Powell's dog leg method
  • Truncated Newton
Hessians
  • Newton's method
Graph of a strictly concave quadratic function with unique maximum.
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
  • Cutting-plane method
  • Reduced gradient (Frank–Wolfe)
  • Subgradient method
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
  • Active-set method
Combinatorial
Paradigms
  • Approximation algorithm
  • Dynamic programming
  • Greedy algorithm
  • Integer programming
    • Branch and bound/cut
Graph
algorithms
Minimum
spanning tree
  • Borůvka
  • Prim
  • Kruskal
Shortest path
  • Bellman–Ford
    • SPFA
  • Dijkstra
  • Floyd–Warshall
Network flows
  • Dinic
  • Edmonds–Karp
  • Ford–Fulkerson
  • Push–relabel maximum flow
Metaheuristics
  • Evolutionary algorithm
  • Hill climbing
  • Local search
  • Parallel metaheuristics
  • Simulated annealing
  • Spiral optimization algorithm
  • Tabu search
  • Software
Template documentation[view] [edit] [history] [purge]

Usage

[edit]

Place this template at the bottom of appropriate articles in optimization:

{{Optimization algorithms}}

For most transcluding articles, you should add the variable designating the most relevant sub-template: The additional variable will display the sub-template's articles (while hiding the articles in the other sub-templates):

{{Optimization algorithms|unconstrained}}
{{Optimization algorithms|constrained}}
{{Optimization algorithms|convex}}
{{Optimization algorithms|combinatorial}}
{{Optimization algorithms|heuristic}}

With the optional command |state=collapsed, the whole (optimization algorithms) navbox will be initially displayed in its collapsed (hidden) state, e.g. {{Optimization algorithms|convex|state=collapsed}}.

See also

[edit]
  • {{Major subfields of optimization}}
  • {{Navbox with collapsible groups}}
The above documentation is transcluded from Template:Optimization algorithms/doc. (edit | history)
Editors can experiment in this template's sandbox (create | mirror) and testcases (create) pages.
Add categories to the /doc subpage. Subpages of this template.
DZ
DefZone.Net

Noi chia se kien thuc, huong dan va kham pha cong nghe.

Lien ket nhanh

Trang chủBài viếtWikiCửa hàngLiên hệ

Liên hệ

Email: defzone.net@gmail.com
Điện thoại: +84 762 559 696
Địa chỉ: Thiên Hương, Thủy Nguyên, Hải Phòng

Đăng ký nhận tin

Nhận bài viết và cập nhật mới nhất qua email.

© 2025 DefZone.Net. All rights reserved.
PrivacyTermsSitemap