Category:Mathematical optimization

• Calculus of variations
• Mathematical optimization
• Optimal design
• Response surface methodology

2

• 2-opt

3

• 3-opt

A

• Active set method
• Adaptive simulated annealing
• Algebraic modeling language
• AMPL
• Applicable mathematics

B

• Backtracking line search
• Barrier function
• Bayesian efficiency
• Bellman equation
• Bilevel optimization
• Bilinear program
• Binding constraint

C

• Cake number
• Candidate solution
• Central composite design
• Chebyshev center
• Combinatorial data analysis
• Complementarity theory
• Compressed sensing
• Conic optimization
• Constrained optimization
• Constraint (mathematics)
• Convex analysis
• Convex optimization

D

• Dantzig–Wolfe decomposition
• Descent direction
• Differential evolution
• Distributed constraint optimization
• Dual cone and polar cone
• Duality (optimization)
• Dynamic programming

E

• Evolutionary multimodal optimization
• Extended newsvendor model

F

• Farkas' lemma
• Feasible region
• Fenchel's duality theorem
• Fritz John conditions

G

• Genetic algorithm
• Genetic programming
• Geometric programming
• Global optimization
• Global optimum
• Goal programming
• Guess value

H

• Highly optimized tolerance
• Hilbert basis (linear programming)
• Himmelblau's function
• Hyper-heuristic

I

• Infinite-dimensional optimization

J

• Jeep problem
• Job shop scheduling

L

• Lagrange multiplier
• Lagrangian relaxation
• Lazy caterer's sequence
• Least absolute deviations
• Least squares
• Level set method
• Line search
• Linear complementarity problem
• Lloyd's algorithm
• Local optimum

M

• Matheuristics
• Maxima and minima
• Maximum theorem
• Meta-optimization
• Metaheuristic
• Mixed complementarity problem
• Moving least squares
• Multidisciplinary design optimization
• Multiprocessor scheduling

N

• Nearest neighbor search
• Newsvendor model
• Nl (format)
• No free lunch in search and optimization
• Non-binding constraint
• Nonlinear complementarity problem
• Nonlinear programming

O

• Odds algorithm
• Operations research
• Optimal control
• Optimal stopping
• Optimal substructure

P

• P versus NP problem
• Pareto efficiency
• Pattern search (optimization)
• Pontryagin's maximum principle
• Posynomial
• Process optimization
• Pseudoconvex function

Q

• Quadratic programming
• Quadratically constrained quadratic program

R

• Random optimization
• Rastrigin function
• Recursive economics
• Reduced cost
• Relaxation (approximation)
• Robbins' problem
• Robust optimization
• Rosenbrock function

S

• Second-order cone programming
• Semi-continuity
• Semidefinite programming
• Shape optimization
• Shekel function
• Signomial
• Single-machine scheduling
• Sion's minimax theorem
• Smoothed analysis
• Special ordered set
• Sports rating system
• Starmad
• Steiner's problem
• Stigler diet
• Stochastic programming
• Subderivative
• Successive linear programming

T

• Ternary search
• Test functions for optimization
• Topology optimization
• Trust region

V

• Variational Monte Carlo

W

• Walrasian auction
• Wolfe conditions