Faịlụ:Max paraboloid.svg
Ọdịdị
Size of this PNG preview of this SVG file: 700 × 560 piksels. Ndị ọzọ mkpebi:300 × 240 piksels | 600 × 480 piksels | 960 × 768 piksels | 1,280 × 1,024 piksels | 2,560 × 2,048 piksels.
Failụ si na nke mbu (usòrò SVG, nà áhà pixel 700 × 560, ívụ usòrò: 263 KB)
Ịta nke usòrò
Bìri èhì/ogè k'ị hụ òtù ụ̀fa dị̀ m̀gbè ahụ̀.
Èhì/Ogè | Mbọ-aka | Ógólógó na asaá | Òjìème | Nkwute | |
---|---|---|---|---|---|
dị ùgbu â | 09:12, 3 Ọgọọst 2015 | 700 × 560 (263 KB) | IkamusumeFan | User created page with UploadWizard |
Ojiji faịlụ
Ọdighi ihuakwụkwọ nwere failụ a.
Ejiji failụ zụrụ ọha
Wikis ndi a edeputara na eji kwa failụ a:
- Ihe eji na ar.wikipedia.org
- Ihe eji na ba.wikipedia.org
- Ihe eji na el.wikipedia.org
- Ihe eji na en.wikipedia.org
- Iterative method
- Newton's method
- Quadratic programming
- Linear programming
- Dijkstra's algorithm
- Mathematical optimization
- Greedy algorithm
- Dynamic programming
- Gradient descent
- Floyd–Warshall algorithm
- Edmonds–Karp algorithm
- Simplex algorithm
- Hill climbing
- Tabu search
- Integer programming
- Combinatorial optimization
- Discrete optimization
- Branch and bound
- Register allocation
- Approximation algorithm
- Ant colony optimization algorithms
- Nonlinear programming
- Column generation
- Swarm intelligence
- Metaheuristic
- Levenberg–Marquardt algorithm
- Gauss–Newton algorithm
- Newton's method in optimization
- Line search
- Cutting-plane method
- Interior-point method
- Wolfe conditions
Lee more global usage of this file.