Mathematical Optimization

B

• Mathematical optimization in business (1 C, 23 P)

C

• Combinatorial optimization (5 C, 77 P)
• Convex optimization (35 P)

D

• Deterministic global optimization (3 P)

M

• Mathematical optimization software (76 P)

O

• Optimization algorithms and methods (7 C, 183 P)
• Optimization of ordered sets (4 P)

S

• Stochastic optimization (1 C, 28 P)

V

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

• Mathematical optimization

A

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

B

• Backtracking line search
• Barzilai-Borwein method
• 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

D

• DMelt:DataAnalysis/5 Fitting Data
• DMelt:DataAnalysis/6 Advanced Data Fitting
• DMelt:DataAnalysis/7 Fitting Shapes
• Dead-end elimination
• Descent direction
• Deterministic global optimization
• Discrete optimization
• Dispersive flies optimisation
• Distributed constraint optimization
• Dual norm

E

• Elbow of a curve
• Elbow of the curve
• ELECTRE
• ÉLECTRE
• Chemistry:Energy minimization
• Earth: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
• Organization: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 search problem
• Liner shipping network design and scheduling problem
• Local optimum
• Low-rank approximation

M

• Map segmentation
• Organization:Mathematical Optimization Society
• Mathematical programming with equilibrium constraints
• Max–min inequality
• Maxima and minima
• Maximum and minimum
• Maximum theorem
• MCACEA
• Mean field annealing
• Measuring attractiveness by a categorical-based evaluation technique
• Measuring attractiveness by a categorical-based evaluation technique (MACBETH)
• 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
• Earth:Open energy system models
• Optimal apportionment
• Optimal control
• Optimal design
• Optimal experimental design
• Optimistic knowledge gradient

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

• Response surface methodology
• Robust optimization

S

• Separation oracle
• Set-valued function
• Shape optimization
• Similarity-based-TOPSIS
• Simulation-based optimization
• Smoothed analysis
• State transition algorithm
• Subgradient method
• Sum-of-squares optimization
• Superiority and inferiority ranking method

T

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

U

• Utilitarian rule
• Utility maximization problem

V

• VIKOR method

W

• Wolfe conditions