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 (38 P)
E
- Exchange algorithms (10 P)
G
- Gradient methods (11 P)
L
- Least squares (41 P)
Pages in category "Optimization algorithms and methods"
The following 161 pages are in this category, out of 161 total.
A
B
- Backtracking line search
- Bacterial colony optimization
- Basin-hopping
- Benson's algorithm
- 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
D
E
F
G
I
L
M
N
P
Q
R
S
- Search-based software engineering
- Second-order cone programming
- Semidefinite embedding
- Sequential linear-quadratic programming
- Sequential minimal optimization
- Sequential quadratic programming
- Simplex algorithm
- Simulated annealing
- Social:Social cognitive optimization
- Space allocation problem
- Special ordered set
- Spiral optimization algorithm
- Stochastic dynamic programming
- Stochastic gradient Langevin dynamics
- Stochastic hill climbing
- Stochastic programming
- Subgradient method
- Successive linear programming
