User:Amatdiou/Books/Mathematical optimization

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 ]

Mathematical optimization

Category: Mathematical optimization; Calculus of variations; Energy minimization; Mathematical optimization; Optimal design; Response surface methodology; 2-opt; 3-opt; Active set; Adaptive projected subgradient method; Adaptive simulated annealing; AIMMS; Algebraic modeling language; AMPL; SAMPL; Analytica (software); APMonitor; APOPT; 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; Candidate solution; Central composite design; Chebyshev center; Combinatorial data analysis; Complementarity theory; Compressed sensing; Conic optimization; Constrained optimization; Constraint (mathematics); 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; Entropy maximization; Extended newsvendor model; Farkas' lemma; Feasible region; Fenchel's duality theorem; Fractional programming; Fritz John conditions; Gene expression programming; 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 control problem; Iterated conditional modes; Jeep problem; Job shop scheduling; Job-shop problem; 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 Society; Mathematical programming with equilibrium constraints; Mathematics of Operations Research; Matheuristics; Maxima and minima; Maximum theorem; 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; Nonlinear complementarity problem; Nonlinear programming; NP-complete; Odds algorithm; Open-shop scheduling; Operations research; Optimal control; Optimal stopping; Optimal substructure; Ordinal optimization; P versus NP problem; Paper bag problem; Paradiseo; Parallel metaheuristic; Pareto efficiency; Pattern search (optimization); Perturbation function; Pontryagin's minimum 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); Robbins' problem; Robust optimization; Rosenbrock function; RTCP hierarchical aggregation; Second-order cone programming; Self-concordant function; Semi-continuity; Semidefinite programming; Shape optimization; Shekel function; Signomial; Single-machine scheduling; Sion's minimax theorem; Slack variable; Slater's condition; Smoothed analysis; Sol (format); Special ordered set; 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; Wing-shape optimization; Wolfe conditions; Wolfe duality
Category: Convex analysis; Bipolar theorem; Characteristic function (convex analysis); Closed convex function; Complex convexity; Concave function; Convex cone; Convex conjugate; Convex function; Convex hull; Convex set; Dieudonné's theorem; Effective domain; Ekeland's variational principle; Epigraph (mathematics); Fenchel–Moreau theorem; Gauss–Lucas theorem; Hilbert projection theorem; Hypograph (mathematics); Invex function; Jensen's inequality; Kachurovskii's theorem; Karamata's inequality; Legendre transformation; Linear separability; Logarithmically concave function; Minkowski functional; Minkowski's theorem; Modulus and characteristic of convexity; Moreau's theorem; Polyconvex function; Popoviciu's inequality; Proper convex function; Recession cone; R. Tyrrell Rockafellar; Schur-convex function; Shephard's problem; Strictly convex space; Tonelli's theorem (functional analysis); Uniformly convex space; Uniformly smooth space
Category: Convex optimization; Ellipsoid method; Geodesic convexity; Linear programming
Category: Mathematical optimization software; List of optimization software; ASCEND; ASTOS; BARON; CasADi; COIN-OR; Concorde TSP Solver; Coopr; CPLEX; CUTEr; DIDO (software); EasyLocal++; EMSO simulator; FortMP; FortSP; Galahad library; GAUSS (software); General Algebraic Modeling System; GNU Linear Programming Kit; Gurobi; Investigative Optimization Library; IOSO; IPOPT; JModelica.org; JOptimizer; KNITRO; LIONsolver; MapleSim; Mathematica; MCSim; MINOS (optimization software); MINTO; MOSEK; NMath; OpenOpt; OPL Development Studio; OptaPlanner; Optimization Toolbox; OptimJ; Optimus platform; PENOPT; PROPT; SCIP (optimization software); SmartDO; SNOPT; TOMLAB; TOMNET; TomSym; TOMVIEW; WORHP
Category: Optimal control; Ross' π lemma; Algebraic Riccati equation; Bang–bang control; Caratheodory-π solution; Costate equations; Covector mapping principle; Gauss pseudospectral method; Hamilton–Jacobi–Bellman equation; Hamiltonian (control theory); Legendre–Clebsch condition; Linear-quadratic regulator; Linear-quadratic-Gaussian control; Optimal projection equations; Bellman pseudospectral method; Chebyshev pseudospectral method; Flat pseudospectral method; Legendre pseudospectral method; Pseudospectral knotting method; Pseudospectral optimal control; Ross–Fahroo lemma; Ross–Fahroo pseudospectral method; Sethi model
Category: Optimization in vector spaces; Generalized semi-infinite programming; Kantorovich theorem; Moment problem; Semi-infinite programming; Transportation theory (mathematics)
Category: Calculus of variations; Variational principle; Action (physics); Applications of the calculus of variations; Beltrami identity; Bounded variation; Brunn–Minkowski theorem; Caccioppoli set; Chaplygin problem; De Donder–Weyl theory; Direct method in the calculus of variations; Dirichlet's energy; Dirichlet's principle; Energy principles in structural mechanics; Envelope theorem; Euler–Lagrange equation; Fermat's principle; First variation; Functional derivative; Fundamental lemma of calculus of variations; Γ-convergence; Geodesics on an ellipsoid; Geometric analysis; Hamilton's principle; Hilbert's nineteenth problem; History of variational principles in physics; Hu Washizu principle; Inverse problem for Lagrangian mechanics; Isoperimetric inequality; Lagrangian system; List of variational topics; Malliavin calculus; Maupertuis' principle; Minkowski's first inequality for convex bodies; Minkowski–Steiner formula; Morse–Palais lemma; Mosco convergence; Mountain pass theorem; Nehari manifold; Noether identities; Noether's second theorem; Noether's theorem; Obstacle problem; Palais–Smale compactness condition; Path of least resistance; Plateau's problem; Principle of least action; Pseudo-monotone operator; Regularized canonical correlation analysis; Saint-Venant's theorem; Signorini problem; Transversality (mathematics); Variational bicomplex; Variational inequality; Variational vector field; Weierstrass–Erdmann condition