User:Karoshbn/Books/MATHEMATICS XXII - Optimization

Optimization

 * Mathematical optimization
 * Optimization problem
 * Maxima and minima
 * Function of a real variable
 * Iterative method
 * Heuristic (computer science)
 * Nonlinear programming
 * Subroutine
 * Function (mathematics)
 * Golden section search
 * Powell's method
 * Line search
 * Nelder–Mead method
 * Successive parabolic interpolation
 * Gradient
 * Local convergence
 * Trust region
 * Wolfe conditions
 * Quasi-Newton method
 * Broyden–Fletcher–Goldfarb–Shanno algorithm
 * Limited-memory BFGS
 * Davidon–Fletcher–Powell formula
 * Symmetric rank-one
 * Gauss–Newton algorithm
 * Gradient descent
 * Levenberg–Marquardt algorithm
 * Nonlinear conjugate gradient method
 * Truncated Newton method
 * Barrier function
 * Penalty method
 * Augmented Lagrangian method
 * Sequential quadratic programming
 * Successive linear programming
 * Convex optimization
 * Cutting-plane method
 * Frank–Wolfe algorithm
 * Subgradient method
 * Linear programming
 * Quadratic programming
 * Affine scaling
 * Ellipsoid method
 * Karmarkar's algorithm
 * Matroid
 * Greedy algorithm
 * Simplex algorithm
 * Revised simplex method
 * Criss-cross algorithm
 * Lemke's algorithm
 * Combinatorial optimization
 * Approximation algorithm
 * Dynamic programming
 * Integer programming
 * Branch and bound
 * Branch and cut
 * List of algorithms
 * Minimum spanning tree
 * Bellman–Ford algorithm
 * Borůvka's algorithm
 * Dijkstra's algorithm
 * Floyd–Warshall algorithm
 * Johnson's algorithm
 * Kruskal's algorithm
 * Flow network
 * Dinic's algorithm
 * Edmonds–Karp algorithm
 * Ford–Fulkerson algorithm
 * Push–relabel maximum flow algorithm
 * Metaheuristic
 * Evolutionary algorithm
 * Hill climbing
 * Local search (optimization)
 * Simulated annealing
 * Tabu search