File:Max paraboloid.svg
From Wikipedia the free encyclopedia
Original file (SVG file, nominally 700 × 560 pixels, file size: 263 KB)
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 09:12, 3 August 2015 | 700 × 560 (263 KB) | IkamusumeFan | User created page with UploadWizard |
File usage
More than 100 pages use this file. The following list shows the first 100 pages that use this file only. A full list is available.
- Ant colony optimization algorithms
- Approximation algorithm
- Artificial bee colony algorithm
- Augmented Lagrangian method
- Barrier function
- Bat algorithm
- Bayesian optimization
- Bees algorithm
- Berndt–Hall–Hall–Hausman algorithm
- Biconvex optimization
- Big M method
- Branch and bound
- Branch and cut
- Branch and price
- Broyden's method
- Broyden–Fletcher–Goldfarb–Shanno algorithm
- Column generation
- Combinatorial optimization
- Constrained optimization
- Convex optimization
- Coordinate descent
- Criss-cross algorithm
- Cuckoo search
- Cutting-plane method
- Davidon–Fletcher–Powell formula
- Dijkstra's algorithm
- Dinic's algorithm
- Discrete optimization
- Distributed constraint optimization
- Dynamic programming
- Edmonds–Karp algorithm
- Ellipsoid method
- Evolutionary multimodal optimization
- Extremal optimization
- Firefly algorithm
- Floyd–Warshall algorithm
- Fourier–Motzkin elimination
- Frank–Wolfe algorithm
- Gauss–Newton algorithm
- Generalized iterative scaling
- Golden-section search
- Gradient descent
- Gradient method
- Great deluge algorithm
- Greedy algorithm
- Guided local search
- Hill climbing
- Integer programming
- Interior-point method
- Iterative method
- Karmarkar's algorithm
- Klee–Minty cube
- Lemke's algorithm
- Levenberg–Marquardt algorithm
- Limited-memory BFGS
- Line search
- Linear programming
- Liu Gang
- Mathematical optimization
- Meta-optimization
- Metaheuristic
- Nelder–Mead method
- Newton's method
- Newton's method in optimization
- Nonlinear conjugate gradient method
- Nonlinear programming
- Parallel metaheuristic
- Penalty method
- Powell's method
- Push–relabel maximum flow algorithm
- Quadratic programming
- Quantum annealing
- Quasi-Newton method
- Register allocation
- Revised simplex method
- Rosenbrock methods
- Scoring algorithm
- Semidefinite programming
- Sequential minimal optimization
- Sequential quadratic programming
- Shortest path faster algorithm
- Simplex algorithm
- Special ordered set
- Subgradient method
- Successive linear programming
- Successive parabolic interpolation
- Swarm intelligence
- Symmetric rank-one
- Tabu search
- Truncated Newton method
- Trust region
- Wolfe conditions
- Talk:Mathematical optimization/Archive 1
- User:Bmears11/mysandbox/Branch and Price
- User:Bmears11/mysandbox/Integer Linear Programming
- User:Bmears11/mysandbox/Integer Linear Programming/branch and cut
- User:IkamusumeFan
- User:JudieT/sandbox
- User:Marco castellani 1965/sandbox
- User:Nmillerche/sandbox/Combinatorial optimization
View more links to this file.
Global file usage
The following other wikis use this file:
- Usage on ar.wikipedia.org
- Usage on ba.wikipedia.org
- Usage on el.wikipedia.org
- Usage on fa.wikipedia.org
- Usage on he.wikipedia.org
- Usage on hyw.wikipedia.org
- Usage on id.wikipedia.org
- Usage on ja.wikipedia.org
View more global usage of this file.