Category
page 1Optimization algorithms and methods
Newton's method
algorithm for finding a zero of a function
least squares method
approximation method in statistics
dynamic programming
problem optimization method that simplifies a complicated problem by decomposing it into simpler subproblems recursively
divide-and-conquer algorithm
algorithm design paradigm based on multi-branched recursion
simplex algorithm
algorithm
greedy algorithm
algorithm that makes locally optimal choices in a sequence of steps with the goal of reaching a global optimum
Minimax
Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics, and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario. When dealing with gains, it is referred to as "maximin" – to maximize the minimum gain. Originally formulated for several-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of u
evolutionary algorithm
subset of evolutionary computation
nonlinear programming
solution process for some optimization problems
gradient descent
optimization algorithm
ant colony optimization algorithms
probabilistic techniques for solving computational problems that can be reduced to finding good paths through graphs
list of algorithms
Wikimedia list article
expectation–maximization algorithm
iterative method for finding maximum likelihood estimates in statistical models
simulated annealing
numerical optimization technique for searching for a solution in a space otherwise too large for ordinary search methods to yield results
particle swarm optimization
optimization method using a set of candidate solutions moving around in the search-space
alpha–beta pruning
search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree
Gauss–Newton algorithm
algorithm used to solve non-linear least squares problems
local search
method for problem solving in optimization
branch and bound
algorithm for optimization problems
Nelder–Mead method
Numerical optimization algorithm
Levenberg–Marquardt algorithm
algorithm
quadratic programming
solving an optimization problem with a quadratic objective function
quantum annealing
method for finding solutions to combinatorial optimisation problems and ground states of glassy systems using quantum fluctuations
bin packing problem
operations research problem of packing items into the fewest bins
line search
optimization algorithm
learning rate
tuning parameter (hyperparameter) in optimization
Trust region
term used in mathematical optimization
golden section search
technique for finding the maximum of a unimodal function by probing a sequence of points whose distances decrease in the golden ratio at each step
matrix chain multiplication
optimization problem
cutting-plane method
optimization technique for solving (mixed) integer linear programs
Frank–Wolfe algorithm
optimization algorithm
Broyden–Fletcher–Goldfarb–Shanno algorithm
optimization method
Newton's method in optimization
Method for finding stationary points of a function
Karmarkar's algorithm
linear programing method
interior point method
algorithms for solving convex optimization problems
ternary search
technique in computer science for finding the minimum or maximum of a unimodal function
Lloyd's algorithm
method for creating geometric centroidal tessellations from points
sequential minimal optimization
optimization algorithm for training support vector machines
level set method
conceptual framework for using level sets as a tool for numerical analysis of surfaces and shapes
maximum subarray problem
the task of finding a contiguous subarray with the largest sum in a given array of numbers
Fourier–Motzkin elimination
mathematical algorithm for eliminating variables from a system of linear inequalities
branch and cut
procedure in combinatorial optimization
Penalty method
type of algorithm for constrained optimization
Stochastic programming
framework for modeling optimization problems that involve uncertainty
Active set method
Mathematical optimization algorithm
least-squares spectral analysis
frequency-domain analysis method
Negamax
Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game.
random search
numerical optimization method
Pattern search
family of numerical optimization methods
cross-entropy method
Monte Carlo method for importance sampling and optimization
second-order cone programming
convex optimization problem
Gradient method
Subgradient method
concept in convex optimization mathematics
Kantorovich theorem
theorem about initial conditions that insure the convergence of Newton's method
Sequential quadratic programming
optimization algorithm
Odds algorithm
method of computing optimal strategies for last-success problems
Guillotine problem
process of producing small rectangular items of fixed dimensions