User:Operowland/Books/qin2

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 ]

qin2

optimization order theory probability & statistics

OPTIMIZATION: 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; Calculus of variations; Candidate solution; Central composite design; Chebyshev center; Combinatorial data analysis; Complementarity theory; Compressed sensing; Conic optimization; Constrained optimization; Constraint (mathematics); Constructive cooperative coevolution; Continuous optimization; Convex analysis; Convex optimization; Corner solution; Danskin's theorem; Dantzig–Wolfe decomposition; Dead-end elimination; Demand optimization; Descent direction; Differential evolution; Discrete optimization; Distributed constraint optimization; DNSS point; Dual cone and polar cone; Duality (optimization); Duality gap; Dynamic programming; Energy minimization; Entropy maximization; Evolutionary multimodal optimization; Extended newsvendor model; Farkas' lemma; Feasible region; Fenchel's duality theorem; Fractional programming; Fritz John conditions; Genetic algorithm; Genetic programming; Geometric median; Geometric programming; Global optimization; Global optimum; 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; 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; Mathematical optimization; Mathematical Optimization Society; Mathematical programming with equilibrium constraints; Mathematics of Operations Research; Matheuristics; Maxima and minima; Maximum theorem; Max–min inequality; MCACEA; Mean field annealing; Meta-optimization; Metaheuristic; 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-complete; Odds algorithm; Open-shop scheduling; Operations research; Optimal control; Optimal design; 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; Probabilistic-based design optimization; Process optimization; Pseudo-Boolean function; Pseudoconvex function; Quadratic programming; Quadratically constrained quadratic program; Quasiconvex function; Random optimization; Rastrigin function; Recursive economics; Reduced cost; Relaxation (approximation); Response surface methodology; Robbins' problem; Robust optimization; Rosenbrock function; SAMPL; Second-order cone programming; Self-concordant function; Semi-continuity; Semidefinite programming; Shape optimization; Shekel function; Shuffled frog leaping algorithm; Signomial; 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 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; Variational Monte Carlo; Vector optimization; Wald's maximin model; Walrasian auction; Weak duality; Weber problem; Wing-shape optimization; Wolfe conditions; Wolfe duality
ORDER THEORY: 1/3–2/3 conjecture; Alexandrov topology; Amoeba order; Antichain; Aronszajn line; Ascending chain condition; Atom (order theory); Better-quasi-ordering; Betweenness; Boolean prime ideal theorem; Bound graph; Bounded complete poset; Bounded set; Bourbaki–Witt theorem; Bruhat order; Causal sets; Centered set; Chain complete; Closure operator; Cofinal (mathematics); Cofinality; Compact element; Comparability; Comparability graph; Complete Boolean algebra; Complete Heyting algebra; Complete partial order; Completely distributive lattice; Completeness (order theory); Containment order; Countable chain condition; Countryman line; Covering relation; Critical pair (order theory); Cyclic order; Dedekind cut; Dedekind–MacNeille completion; Dehornoy order; Dense order; Deviation of a poset; Dilworth's theorem; Directed set; Disjunction property of Wallman; Distributivity (order theory); Duality (order theory); Embedding; Encompassment ordering; Fence (mathematics); Filter (mathematics); Friedman’s SSCG function; Frink ideal; Fréchet filter; Galois connection; Glossary of order theory; Graded poset; Greatest element; Greedoid; Hasse diagram; Hausdorff gap; Hausdorff maximal principle; Higman's lemma; Ideal (order theory); Incidence algebra; Incidence poset; Infimum and supremum; Infinite descending chain; Infinite divisibility; Interval (mathematics); Interval order; Inversion (discrete mathematics); Join and meet; Kernel operator; Kleene fixed-point theorem; Kleene–Brouwer order; Knaster's condition; Knaster–Tarski theorem; Kruskal's tree theorem; Least fixed point; Least-upper-bound property; Lexicographical order; Limit-preserving function (order theory); Linear continuum; Linear extension; Linked set; List of order structures in mathematics; List of order theory topics; Locally finite poset; Lubell–Yamamoto–Meshalkin inequality; Majorization; Maximal element; Mirsky's theorem; Monomial order; Monotonic function; Multitree; Möbius inversion formula; Nucleus (order theory); Order (journal); Order dimension; Order isomorphism; Order theory; Order topology; Order-embedding; Ordered geometry; Ordered pair; Ordinal sum; Pantachy; Partial cyclic order; Partially ordered group; Partially ordered set; Pasch's theorem; Path ordering (term rewriting); Peck poset; Pointwise order; Poset topology; Prefix order; Preorder; Preordered class; Prewellordering; Prime (order theory); Product order; Projection (order theory); Pseudo-order; Pseudoideal; Quantale; Ranked poset; Residuated mapping; Rewrite order; Scattered order; Schnyder's theorem; Schur–Horn theorem; Scott continuity; Scott domain; Semiorder; Separation relation; Series-parallel partial order; Shortlex order; Specialization (pre)order; Sperner property of a partially ordered set; Stone duality; Strong antichain; Supermodular function; Suslin's problem; Teichmüller–Tukey lemma; Topkis's theorem; Total order; Trichotomy (mathematics); Ultrafilter; Upper and lower bounds; Upper set; Upper topology; Weak ordering; Well-order; Well-quasi-ordering; Zorn's lemma; Η set
PROBABILITY AND STATISTICS: Cokurtosis; Concomitant (statistics); Glossary of probability and statistics; Inductive probability; List of probability topics; Marginal structural model; Notation in probability and statistics; Outline of probability; Probability; Probability and statistics; Trapezoidal distribution