File:Max paraboloid.svg
From HandWiki
Size of this PNG preview of this SVG file: 700 × 560 pixels. Other resolution: 600 × 480 pixels.
Original file (SVG file, nominally 700 × 560 pixels, file size: 263 KB)
Summary
Submitted to commons.wikimedia.org
Licensing
This file is licensed under the Attribution-Share Alike 3.0 Unported (CC BY-SA 3.0) license. You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 03:24, 7 October 2022 | | 700 × 560 (263 KB) | Maintenance script (talk | contribs) | == Summary == Submitted to commons.wikimedia.org == Licensing == {{CC BY-SA 3.0}} |
You cannot overwrite this file.
File usage
The following 2 files are duplicates of this file (more details):
- File:Max paraboloid.svg from a shared repository
- File:Max paraboloid.svg from Wikimedia Commons
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.
- Affine scaling
- Ant colony optimization algorithms
- Approximation algorithm
- Artificial bee colony algorithm
- Augmented Lagrangian method
- BOBYQA
- 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
- COBYLA
- Column generation
- Combinatorial optimization
- Constrained optimization
- Convex optimization
- Coordinate descent
- Criss-cross algorithm
- Cutting-plane method
- Davidon–Fletcher–Powell formula
- Dijkstra's algorithm
- Dinic's algorithm
- Distributed constraint optimization
- Dynamic programming
- Edmonds–Karp algorithm
- Ellipsoid method
- Evolutionary multimodal optimization
- Extremal optimization
- Firefly algorithm
- Fireworks 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
- Harmony search
- Hill climbing
- Integer programming
- Interior-point method
- Iterative method
- Karmarkar's algorithm
- Klee–Minty cube
- LINCOA
- Lemke's algorithm
- Levenberg–Marquardt algorithm
- Limited-memory BFGS
- Line search
- Linear programming
- Mathematical optimization
- Meta-optimization
- Minimum Population Search
- Multitask optimization
- NEWUOA
- Nelder–Mead method
- Newton's method
- Newton's method in optimization
- Nonlinear conjugate gradient method
- Nonlinear programming
- Parallel metaheuristic
- Penalty method
- Powell's dog leg 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 linear-quadratic programming
- Sequential minimal optimization
- Sequential quadratic programming
- Shortest Path Faster Algorithm
- Simplex algorithm
- Special ordered set
- Spiral optimization algorithm
- Subgradient method
- Successive linear programming
- Successive parabolic interpolation
- Swarm intelligence
- Symmetric rank-one
- Tabu search
- Truncated Newton method
- Trust region
- UOBYQA
View more links to this file.
