Mathematical optimization
In mathematics, computer science, economics, or management science, mathematical optimization (alternatively, optimization or mathematical programming) is the selection of a best element (with regard ...
Mathematical optimization - Wikipedia
Faster Optimization
Optimization problems are everywhere in engineering: Balancing design tradeoffs is an optimization problem, as are scheduling and logistical planning. The theory — and sometimes the implementation — o...
Bubble, Bubble … Boiling On The Double
The boiling of water is at the heart of many industrial processes, from the operation of electric power plants to chemical processing and desalination. But the details of what happens on a hot surface...
Swarm intelligence - Incremental Social Learning in Swarm Intelligence Algorithms for Optimization
Video presentation of the keynote presentation delivered by Marco A. Montes de Oca at the 2011 International Joint Conference on Computational Intelligence (...
Operations research
Operations what? In a nutshell, Operations Research is the discipline of applying advanced analytics to help you make better business decisions. But why o wh...
Linear programming
Linear programming (LP; also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by l...
Linear programming - Wikipedia
Relaxation (approximation)
In mathematical optimization and related fields, relaxation is a modeling strategy. A relaxation is an approximation of a difficult problem by a nearby problem that is easier to solve. A solution of ...
Variational analysis
Variational analysis is a branch of mathematics that extends the methods arising from the classic calculus of variations and convex analysis to more general problems of optimization theory, including ...
Combinatorial optimization
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects. In many such problems, exhausti...
Convex optimization
Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. The convexity property can make optimization in some sense "easier" than the gener...
Stochastic optimization
Stochastic optimization (SO) methods are optimization methods that generate and use random variables. For stochastic problems, the random variables appear in the formulation of the optimization proble...
Convex analysis
Convex analysis is the branch of mathematics devoted to the study of properties of convex functions and convex sets, often with applications in convex minimization, a subdomain of optimization theory....
Optimal control
Optimal control theory, an extension of the calculus of variations, is a mathematical optimization method for deriving control policies. The method is largely due to the work of Lev Pontryagin and his...
Regression analysis
In statistics, regression analysis is a statistical process for estimating the relationships among variables. It includes many techniques for modeling and analyzing several variables, when the focus i...
Active set
In mathematical optimization, a problem is defined using an objective function to minimize or maximize, and a set of constraints that define the feasible region, that is, the set of all x to search fo...
Faster Optimization
Optimization problems are everywhere in engineering: Balancing design tradeoffs is an optimization problem, as are scheduling and logistical planning. The theory — and sometimes the implementation — o...
Weak duality
In applied mathematics, weak duality is a concept in optimization which states that the duality gap is always greater than or equal to 0. That means the solution to the primal (minimization) problem ...
Truncation selection
Truncation selection is a selection method used in genetic algorithms to select potential candidate solutions for recombination. In truncation selection the candidate solutions are ordered by fitness,...
Biconvex optimization
Biconvex optimization is a generalization of convex optimization where the objective function and the constraint set can be biconvex. There are methods that can find the global optimum of these proble...
Subderivative
In mathematics, the subderivative, subgradient, and subdifferential generalize the derivative to functions which are not differentiable. The subdifferential of a function is set-valued. Subderivatives...
Subderivative - Wikipedia
Open-shop scheduling
In theoretical computer science and operations research, the open-shop scheduling problem (OSSP) is a scheduling problem in which a given set of jobs must each be processed for given amounts of time ...
Calculus of variations
Calculus of variations is a field of mathematical analysis that deals with maximizing or minimizing functionals, which are mappings from a set of functions to the real numbers. Functionals are often e...