Category:Mathematical optimization Information

B

• ► Mathematical optimization in business‎ (2 C, 20 P)

C

• ► Combinatorial optimization‎ (10 C, 72 P)
• ► Convex optimization‎ (34 P)

D

• ► Deterministic global optimization‎ (3 P)

M

• ► Mathematical optimization software‎ (74 P)

O

• ► Optimization algorithms and methods‎ (8 C, 157 P)
• ► Optimization of ordered sets‎ (4 P)

P

• ► Pareto efficiency‎ (7 P)

R

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

S

• ► Stochastic optimization‎ (2 C, 23 P)

V

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

• Mathematical optimization

*

• Mathematical Optimization Society

A

• Ackley function
• AL procedure
• Analysis of Boolean functions
• Applicable mathematics

B

• Backtracking line search
• 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
• Elbow of the curve
• ELECTRE
• Energy minimization
• Energy modeling

F

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

G

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

H

• Highly optimized tolerance
• Himmelblau's function
• Hydrological optimization
• Hyperparameter optimization

I

• International Society for Structural and Multidisciplinary Optimization

J

• Jeep problem

K

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

L

• Lagrange multiplier
• Lazy caterer's sequence
• Linear complementarity problem
• Linear search problem
• Local optimum
• Low-rank approximation

M

• Map segmentation
• Mathematical programming with equilibrium constraints
• Max–min inequality
• Maxima and minima
• Maximum theorem
• MCACEA
• Mean field annealing
• Measuring attractiveness by a categorical-based evaluation technique (MACBETH)
• Minimax theorem
• Mixed complementarity problem
• Mixed linear complementarity problem
• 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 control
• Optimal design
• Optimistic knowledge gradient
• Oracle complexity (optimization)

P

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

Q

• Quadratically constrained quadratic program

R

• Rastrigin function
• Relaxation (approximation)
• Response surface methodology
• Robust optimization
• Rosenbrock function

S

• S-procedure
• Shape optimization
• Shekel function
• Signomial
• Simulation-based optimization
• Sion's minimax theorem
• Smoothed analysis
• Steiner's calculus problem
• Stochastic multicriteria acceptability analysis
• Stress majorization
• Sum-of-squares optimization
• Superiority and inferiority ranking method
• Superiorization

T

• Topological derivative
• Topology optimization
• TOPSIS
• Trajectory optimization

U

• Utility maximization problem

V

• Variational Monte Carlo
• Vector optimization
• VIKOR method

W

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