User:Waterbug89/Books/Optimization
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
- Calculus of variations
- Deterministic global optimization
- Energy minimization
- Mathematical optimization
- Optimal design
- Response surface methodology
- 2-opt
- 3-opt
- Active set method
- Adaptive simulated annealing
- AIMMS
- Algebraic modeling language
- AMPL
- Analytica (software)
- APMonitor
- APOPT
- Applicable mathematics
- Assemble-to-order system
- Backtracking line search
- Backward induction
- Barrier function
- Basis pursuit
- Basis pursuit denoising
- Bayesian efficiency
- Bellman equation
- Benders decomposition
- Biconvex optimization
- Bilevel optimization
- Bilinear program
- Binary constraint
- Binding constraint
- Bregman method
- Cake number
- Central composite design
- Chebyshev center
- Clarke's generalized Jacobian
- Combinatorial data analysis
- Complementarity theory
- Compressed sensing
- Conic optimization
- Constrained optimization
- Constraint (mathematics)
- Constructive cooperative coevolution
- Constructive heuristic
- Continuous optimization
- Convex analysis
- Convex optimization
- Corner solution
- Danskin's theorem
- Dantzig–Wolfe decomposition
- Dead-end elimination
- Demand optimization
- Descent direction
- Discrete optimization
- Distributed constraint optimization
- Dual cone and polar cone
- Dual norm
- Duality (optimization)
- Duality gap
- Dynamic programming
- Entropy maximization
- Evolutionary multimodal optimization
- Exact algorithm
- Extended newsvendor model
- Farkas' lemma
- Feasible region
- Fenchel's duality theorem
- Fractional programming
- Fritz John conditions
- General Mission Analysis Tool
- Generalized-strain mesh-free formulation
- Genetic algorithm
- Genetic programming
- Geometric median
- Geometric programming
- Global optimization
- Goal programming
- Guess value
- Hardness of approximation
- Highly optimized tolerance
- Hilbert basis (linear programming)
- Himmelblau's function
- Homicidal chauffeur problem
- Hyper-heuristic
- Hyperparameter optimization
- In-crowd algorithm
- Infinite-dimensional optimization
- International Society for Structural and Multidisciplinary Optimization
- Intertemporal budget constraint
- Interval contractor
- Inventory theory
- Iterated conditional modes
- Jeep problem
- Job shop scheduling
- Karush–Kuhn–Tucker conditions
- Klee–Minty cube
- Lagrange multiplier
- Lagrange multipliers on Banach spaces
- Lagrangian relaxation
- Lazy caterer's sequence
- Least absolute deviations
- Least squares
- Lemke's algorithm
- Level set method
- Line search
- Linear complementarity problem
- Linear matrix inequality
- Linear programming decoding
- Linear search problem
- Linear-fractional programming
- Lloyd's algorithm
- Local optimum
- Low-rank approximation
- Map segmentation
- Mathematical Optimization Society
- Mathematical programming with equilibrium constraints
- Mathematics of Operations Research
- Matheuristics
- Max–min inequality
- Maxima and minima
- Maximum theorem
- MCACEA
- Mean field annealing
- Meta-optimization
- Metaheuristic
- Minimax theorem
- Mixed complementarity problem
- Mixed linear complementarity problem
- MOEA Framework
- Moving least squares
- MPS (format)
- Multi-objective optimization
- Multidisciplinary design optimization
- Multiprocessor scheduling
- Nearest neighbor search
- Newsvendor model
- Nl (format)
- No free lunch in search and optimization
- Non-binding constraint
- Non-linear least squares
- Non-negative least squares
- Nonlinear complementarity problem
- Nonlinear programming
- NP-completeness
- Odds algorithm
- Online optimization
- Open-shop scheduling
- Operations research
- Optimal control
- Optimal stopping
- Optimal substructure
- Ordinal optimization
- P versus NP problem
- Paper bag problem
- Paradiseo
- Parallel metaheuristic
- Parametric programming
- Pareto efficiency
- Pattern search (optimization)
- Perturbation function
- Pontryagin's maximum principle
- Posynomial
- Process optimization
- Proximal operator
- Pseudo-Boolean function
- Pseudoconvex function
- Quadratic programming
- Quadratically constrained quadratic program
- Quasiconvex function
- Random optimization
- Rastrigin function
- Recursive economics
- Reduced cost
- Relaxation (approximation)
- Robbins' problem
- Robust fuzzy programming
- Robust optimization
- Rosenbrock function
- S-procedure
- SAMPL
- Second-order cone programming
- Self-concordant function
- Semi-continuity
- Semidefinite embedding
- Semidefinite programming
- Shape optimization
- Shekel function
- Signomial
- Simulation-based optimization
- Single-machine scheduling
- Sion's minimax theorem
- Slack variable
- Slater's condition
- Smoothed analysis
- Sol (format)
- Special ordered set
- Sports rating system
- Starmad
- Steiner's calculus problem
- Stigler diet
- Stochastic programming
- Stress majorization
- Strong duality
- Subderivative
- Subgradient method
- Successive linear programming
- Sum-of-squares optimization
- Ternary search
- Test functions for optimization
- Topological derivative
- Topology optimization
- Total dual integrality
- Trajectory optimization
- Trust region
- Unit commitment problem in electrical power production
- Variational Monte Carlo
- Vector optimization
- Wald's maximin model
- Walrasian auction
- Weak duality
- Weber problem
- Wing-shape optimization
- Wolfe conditions
- Wolfe duality