Category:Mathematical optimization

• Mathematical optimization

A

• Applicable mathematics

B

• Backtracking line search
• Bayesian efficiency
• Bilevel optimization
• Bilinear program
• Binary constraint

C

• Cake number
• Central composite design
• Chebyshev center
• Complementarity theory
• Compressed sensing
• Constrained optimization
• Constraint (mathematics)
• Continuous optimization
• Convex optimization
• Corner solution

D

• Dead-end elimination
• Descent direction
• Discrete optimization
• Distributed constraint optimization
• Dual norm

E

• ÉLECTRE
• Energy minimization

F

• Faustmann's formula
• Feasible region

G

• Geometric median
• Goal programming
• Gradient descent
• Guess value

H

• Highly optimized tolerance

K

• Karush–Kuhn–Tucker conditions

L

• Lagrange multiplier
• Lazy caterer's sequence
• Least-squares spectral analysis
• Linear complementarity problem

M

• Mathematical Optimization Society
• Mathematical programming with equilibrium constraints
• Maximum and minimum
• Minimax theorem
• Mixed complementarity problem
• Multi-attribute global inference of quality
• Multiple-criteria decision analysis
• Multi-objective optimization
• Multidisciplinary design optimization

N

• Nearest neighbor search
• No free lunch in search and optimization

O

• Optimal control
• Optimal experimental design

P

• P versus NP problem
• Paper bag problem
• Pareto efficiency

Q

• Quadratically constrained quadratic program

R

• Relaxation (approximation)
• Response surface methodology
• Robust optimization

S

• Set-valued function
• Shape optimization
• Signomial
• Smoothed analysis
• Stress majorization
• Subgradient method

T

• Topological derivative
• Topology optimization
• Trajectory optimization

U

• Utility maximization problem

V

• Variational Monte Carlo

W

• Walrasian auction
• Wing-shape optimization
• Wolfe conditions