Fáìlì:Max paraboloid.svg
Size of this PNG preview of this SVG file: 700 × 560 pixels. Àwọn ìgbéhàn míràn: 300 × 240 pixels | 600 × 480 pixels | 960 × 768 pixels | 1,280 × 1,024 pixels | 2,560 × 2,048 pixels.
Fáìlì àtìbẹ̀rẹ̀ (faili SVG, pẹ̀lú 700 × 560 pixels, ìtòbi faili: 263 KB)
Ìtàn fáìlì
Ẹ kan kliki lórí ọjọ́ọdún/àkókò kan láti wo fáìlì ọ̀ún bó ṣe hàn ní àkókò na.
Ọjọ́ọdún/Àkókò | Àwòrán kékeré | Àwọn ìwọ̀n | Oníṣe | Àríwí | |
---|---|---|---|---|---|
lọ́wọ́ | 09:12, 3 Oṣù Ògún 2015 | 700 × 560 (263 KB) | IkamusumeFan | User created page with UploadWizard |
Ìlò fáìlì
Kò sí ojúewé tó únlo fáìlì yìí.
Ìlò fáìlì káàkiri
Àwọn wiki míràn wọ̀nyí lo fáìlì yìí:
- Ìlò ní ar.wikipedia.org
- Ìlò ní ba.wikipedia.org
- Ìlò ní el.wikipedia.org
- Ìlò ní 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
- Convex optimization
Ìfihàn ìlò míràn púpọ̀ fún fálì yìí.