Category:Optimization
- The main article for this category is Optimization (mathematics).
Subcategories
This category has the following 7 subcategories, out of 7 total.
C
D
H
M
O
O cont.
R
Pages in category "Optimization"
The following 142 pages are in this category, out of 142 total. Updates to this list can occasionally be delayed for a few days.
2
3
A
B
C
- Calculus of variations
- Candidate solution
- Central composite design
- Chebyshev center
- Combinatorial data analysis
- Conic optimization
- Constrained optimization and Lagrange multipliers
- Constraint (mathematics)
- Constraint optimization
- Continuous optimization
- Convex analysis
- Convex optimization
- Corner solution
D
- Danskin's theorem
- Dantzig-Wolfe decomposition
- Database tuning
- Dead-end elimination
- Demand optimization
- Descent direction
- Differential evolution
- Discrete optimization
- Distributed constraint optimization
- Dual cone and polar cone
- Dual problem
- Dynamic programming
E
F
G
G cont.
H
I
J
K
L
- Lagrange multipliers
- Lagrange multipliers on Banach spaces
- Lagrangian relaxation
- Lazy caterer's sequence
- Least absolute deviations
- Least squares
- Level set method
- Lin-Kernighan
- Line search
- Linear complementarity problem
- Linear least squares
- Linear matrix inequality
- Linear programming
- Linear programming relaxation
- Lloyd's algorithm
- Local optimum
M
- MPS (format)
- Markov decision process
- Mathematical Programming Society
- Mathematics of Operations Research
- Maxima and minima
- Metaheuristic
- Mixed complementarity problem
- Moving least squares
- Multidisciplinary design optimization
- Multiobjective optimization
- Multiprocessor scheduling
N
- NP-complete
- Nearest neighbor search
- Newsvendor
- No free lunch in search and optimization
- Non-linear least squares
- Nonlinear programming
O
- Operations research
- Optimal classification
- Optimal control
- Optimal stopping
- Optimal substructure
- Ordinal optimization
P
- P = NP problem
- Paper bag problem
- Paradiseo
- Pareto efficiency
- Pontryagin's minimum principle
- Posynomial
- Process optimization
Q
- Quadratic programming
- Quadratically constrained quadratic program
- Quality control and genetic algorithms
- Quantum annealing
- Quasiconvex function
R
- RTCP hierarchical aggregation
- Relaxation technique (mathematics)
- Robust optimization
- Rosenbrock function
S
- Second-order cone programming
- Self-concordant function
- Semidefinite programming
- Shape optimization
- Shekel function
- Single machine scheduling
- Sion's minimax theorem
- Slack variable
- Special ordered set
- Steiner's problem
- Stigler diet
- Stochastic programming
- Stress majorization
- Subderivative
- Subgradient method
- Successive linear programming
- Surplus variable
T
U
- User:Petergans/a/sandbox
- User:Petergans/b/sandbox
- User:Petergans/e/sandbox
- User:Petergans/sandbox
- Utility maximization problem
W
Link former page on this page
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
http://wikipedia.atpedia.jp/wiki/%E9%BA%BB%E5%A9%86%E8%B1%86%E8%85%90
-
http://wikipedia.atpedia.jp/wiki/%E7%94%9F%E4%B9%B3
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0
-
[[wikipedia@pedia]] 0