Category:Optimization algorithms and methods
From HandWiki
Here is a list of articles in the category Optimization algorithms and methods of the Computing portal that unifies foundations of mathematics and computations using computers.
 |
Wikimedia Commons has media related to Optimization algorithms and methods. |
Subcategories
This category has the following 7 subcategories, out of 7 total.
D
- Decomposition methods (8 P)
- Dynamic programming (49 P)
E
- Exchange algorithms (11 P)
G
- Gradient methods (18 P)
L
- Least squares (46 P)
Pages in category "Optimization algorithms and methods"
The following 200 pages are in this category, out of 233 total.
(previous page) (next page)A
- Active set method
- Active-set method
- Adaptive coordinate descent
- Adaptive dimensional search
- Affine scaling
- Algorithm IMED
- Approximation algorithm
- Artificial bee colony algorithm
- Bat algorithm
- Bayesian optimization
- Bees algorithm
- Combinatorial optimization
- Constrained optimization
- Convex optimization
- Coordinate descent
- Cuckoo search
- Dijkstra's algorithm
- Distributed constraint optimization
- Evolutionary multimodal optimization
- Firefly algorithm
- Fireworks algorithm
- Floyd–Warshall algorithm
- Great Deluge algorithm
- Guided Local Search
- Harmony search
- Hill climbing
- Integer programming
- Iterative method
- Klee–Minty cube
- Linear programming
- Biography:Liu Gang
- Mathematical optimization
- Meta-optimization
- Minimum Population Search
- Multi-task learning
- Multitask optimization
- Template:Optimization algorithms
- Register allocation
- Revised simplex method
- Rider optimization algorithm
- Scoring algorithm
- Semidefinite programming
- Shortest Path Faster Algorithm
- Shortest path faster algorithm
- Swarm intelligence
- Symmetric rank-one
- Tabu search
- Wolfe conditions
- Alpha–beta pruning
- Ant colony optimization algorithms
- Auction algorithm
- Augmented Lagrangian method
- Automatic label placement
B
- Backtracking line search
- Bacterial colony optimization
- Barzilai-Borwein method
- Barzilai–Borwein method
- Basin-hopping
- Benson's algorithm
- Best arm identification
- Berndt–Hall–Hall–Hausman algorithm
- Bin covering problem
- Bin packing problem
- Bland's rule
- BOBYQA
- Branch and bound
- Branch and cut
- Branch and price
- Bregman Lagrangian
- Bregman method
- Broyden–Fletcher–Goldfarb–Shanno algorithm
C
- Chambolle-Pock algorithm
- Chambolle–Pock algorithm
- COBYLA
- Column generation
- Communication-avoiding algorithm
- Communication-avoiding algorithms
- Compact quasi-Newton representation
- Consensus based optimization
- Constructive heuristic
- Crew scheduling
- Criss-cross algorithm
- Critical line method
- Cross-entropy method
- Cunningham's rule
- Cunningham's Rule
- Cutting-plane method
D
E
F
G
I
K
L
- Lai–Robbins lower bound
- Lawler's algorithm
- Learning rate
- Least squares
- Least-squares spectral analysis
- Lemke's algorithm
- Level-set method
- Levenberg–Marquardt algorithm
- Lexicographic max-min optimization
- Lexicographic optimization
- Limited-memory BFGS
- LINCOA
- Line search
- Linear-fractional programming
- Lloyd's algorithm
- Local convergence
- Local search (optimization)
- Luus–Jaakola
