Category:Mathematical optimization

B

• Mathematical optimization in business (3 C, 24 P)

C

• Combinatorial optimization (11 C, 75 P)
• Convex optimization (1 C, 42 P)

D

• Deterministic global optimization (3 P)

M

• Mathematical optimization journals (4 P)
• Mathematical Optimization Society (1 C, 2 P)
• Mathematical optimization software (80 P)

O

• Optimization algorithms and methods (11 C, 167 P)
• Optimization of ordered sets (3 P)

P

• Pareto efficiency (9 P)

R

• Relaxation (approximation) (1 C, 4 P)

S

• Stochastic optimization (2 C, 27 P)

T

• Test functions for optimization (7 P)

V

• Optimization in vector spaces (2 C, 7 P)

• Mathematical optimization

A

• Algorithmic problems on convex sets
• Analysis of Boolean functions
• Applicable mathematics

B

• Backtracking line search
• Barzilai–Borwein method
• Basis pursuit
• Basis pursuit denoising
• Bauer maximum principle
• Bayesian efficiency
• Bilevel optimization
• Bilinear program
• Binary constraint

C

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

D

• Dead-end elimination
• Descent direction
• Deterministic global optimization
• Discrete optimization
• Dispersive flies optimisation
• Distributed constraint optimization
• Dual norm

E

• Elbow of a curve
• ÉLECTRE
• Energy minimization
• Energy modeling
• ESP-r

F

• Faustmann's formula
• Feasible region
• Fritz John conditions

G

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

H

• Highly optimized tolerance
• Highway network optimization
• Hydrological optimization
• Hyperparameter optimization

I

• Incompatibility of quantum measurements
• International Society for Structural and Multidisciplinary Optimization

J

• Jeep problem
• JuMP

K

• Karush–Kuhn–Tucker conditions
• Keynes–Ramsey rule
• Knee of a curve

L

• Lagrange multiplier
• Lazy caterer's sequence
• Least-squares spectral analysis
• Linear complementarity problem
• Linear search problem
• Liner shipping network design and scheduling problem
• Low-rank approximation

M

• Map segmentation
• Mathematical Optimization Society
• Mathematical programming with equilibrium constraints
• Max–min inequality
• Maximum and minimum
• Maximum theorem
• MCACEA
• Mean field annealing
• Minimax theorem
• Mirror descent
• Mixed complementarity problem
• Mixed linear complementarity problem
• Moreau envelope
• Multi-attribute global inference of quality
• Multiple-criteria decision analysis
• Multi-objective optimization
• Multicriteria classification
• Multidisciplinary design optimization

N

• Nearest neighbor search
• No free lunch in search and optimization
• NP-completeness

O

• Online optimization
• Open energy system models
• Optimal apportionment
• Optimal control
• Optimal experimental design
• Optimistic knowledge gradient
• Oracle complexity (optimization)
• Ordinal priority approach

P

• P versus NP problem
• Paper bag problem
• Pareto efficiency
• PDE-constrained optimization
• Proportional-fair rule
• Proximal operator
• Pseudo-Boolean function

Q

• Quadratically constrained quadratic program

R

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

S

• S-procedure
• Separation oracle
• Set-valued function
• Shape optimization
• Signomial
• Simulation-based optimization
• Smoothed analysis
• Stochastic multicriteria acceptability analysis
• Stress majorization
• Subgradient method
• Sum-of-squares optimization
• Superiority and inferiority ranking method
• Superiorization

T

• Topological derivative
• Topology optimization
• TOPSIS
• Trajectory optimization
• Transit route network design problem

U

• Utilitarian rule
• Utility maximization problem

V

• Variational Monte Carlo
• Vector optimization
• VIKOR method

W

• Wald's maximin model
• Walrasian auction
• Wing-shape optimization
• Wolfe conditions