User:Qdevapps/Books/OPTIMIZATION
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| 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 ] | ||||||||
OPTIMIZATION WIKI-REVIEW
[edit]- CONTINUOUS AND CONVEX OPTIMIZATION
- Mathematical optimization
- Nonlinear programming
- Convex optimization
- Lagrange multiplier
- Karush–Kuhn–Tucker conditions
- Duality (optimization)
- Relaxation (approximation)
- Hill climbing
- Stochastic hill climbing
- Gradient descent
- Conjugate gradient method
- Conjugate residual method
- Preconditioner
- Nonlinear conjugate gradient method
- Stochastic gradient descent
- Newton's method
- Newton's method in optimization
- Quasi-Newton method
- BFGS method
- Limited-memory BFGS
- Hessian matrix
- Nelder–Mead method
- Levenberg–Marquardt algorithm
- Gauss–Newton algorithm
- Line search
- Coordinate descent
- Pattern search (optimization)
- Golden section search
- Brent's method
- Interpolation search
- Bisection method
- Secant method
- False position method
- Ridders' method
- Iterative method
- Rate of convergence
- Random optimization
- Random search
- Luus–Jaakola
- Subderivative
- Subgradient method
- Interior point method
- Projections onto convex sets
- Maximum likelihood
- Mean-shift
- LINEAR PROGRAMMING AND EXTENSIONS
- Linear programming
- Simplex algorithm
- Integer programming
- Cutting-plane method
- Linear programming relaxation
- Branch and cut
- Randomized rounding
- Fractional coloring
- COMBINATORIAL OPTIMIZATION AND SEARCH METHODS
- Combinatorial optimization
- Constraint satisfaction
- Combinatorial search
- Karp's 21 NP-complete problems
- Boolean satisfiability problem
- Maximum satisfiability problem
- Assignment problem
- Quadratic assignment problem
- Quadratic bottleneck assignment problem
- Knapsack problem
- Graph (mathematics)
- Travelling salesman problem
- Clique problem
- Clique cover problem
- Vertex cover
- Exact cover
- Partition problem
- Backtracking
- Branch and bound
- Greedy algorithm
- Dynamic programming
- Binary search algorithm
- GRAPH OPTIMIZATION
- Graph traversal
- Tree traversal
- Depth-first search
- Breadth-first search
- Best-first search
- Beam search
- A* search algorithm
- B*
- IDA*
- Alpha–beta pruning
- Pathfinding
- Kruskal's algorithm
- Prim's algorithm
- Euclidean shortest path
- Bellman–Ford algorithm
- Longest path problem
- Critical path method
- Dijkstra's algorithm
- Dykstra's projection algorithm
- Minimum spanning tree
- GLOBAL AND RANDOMIZED OPTIMIZATION
- Metaheuristic
- Approximation theory
- Stochastic optimization
- Global optimization
- Simulated annealing
- Monte Carlo method
- Stochastic tunneling
- Reactive search optimization
- METAHEURISTICS
- Genetic algorithm
- Evolutionary computation
- Genetic programming
- Evolutionary programming
- Evolution strategy
- Differential evolution
- Ant colony optimization algorithms
- Particle swarm optimization
- Artificial immune system
- Cultural algorithm
- No free lunch in search and optimization