# Category:Optimization algorithms and methods

Computing portal |

Here is a list of articles in the category **Optimization algorithms and methods** of the Computing portal that unifies foundations of mathematics and computations using computers.

Wikimedia Commons has media related to .Optimization algorithms and methods |

## Subcategories

This category has the following 7 subcategories, out of 7 total.

### D

### E

### G

### L

## Pages in category "Optimization algorithms and methods"

The following 165 pages are in this category, out of 165 total.

- List of algorithms
*(computing)*

### A

- Active set method
*(computing)* - Active-set method
*(computing)* - Adaptive coordinate descent
*(computing)* - Adaptive dimensional search
*(computing)* - Adaptive simulated annealing
*(computing)* - Affine scaling
*(computing)* - Alpha–beta pruning
*(computing)* - Ant colony optimization algorithms
*(computing)* - Auction algorithm
*(computing)* - Augmented Lagrangian method
*(computing)* - Automatic label placement
*(computing)*

### B

- Backtracking line search
*(computing)* - Bacterial colony optimization
*(computing)* - Basin-hopping
*(computing)* - Benson's algorithm
*(computing)* - Berndt–Hall–Hall–Hausman algorithm
*(computing)* - Bin packing problem
*(computing)* - Bland's rule
*(computing)* - BOBYQA
*(computing)* - Branch and bound
*(computing)* - Branch and cut
*(computing)* - Branch and price
*(computing)* - Bregman Lagrangian
*(computing)* - Bregman method
*(computing)* - Broyden–Fletcher–Goldfarb–Shanno algorithm
*(computing)*

### C

- CMA-ES
*(computing)* - COBYLA
*(computing)* - Coffman–Graham algorithm
*(computing)* - Column generation
*(computing)* - Communication-avoiding algorithms
*(computing)* - Constructive heuristic
*(computing)* - Crew scheduling
*(computing)* - Criss-cross algorithm
*(computing)* - Critical line method
*(computing)* - Cross-entropy method
*(computing)* - Cunningham's rule
*(computing)* - Cunningham's Rule
*(computing)* - Cutting-plane method
*(computing)*

### D

- DATADVANCE
*(computing)* - Davidon–Fletcher–Powell formula
*(computing)* - Derivation of the conjugate gradient method
*(computing)* - Derivative-free optimization
*(computing)* - Destination dispatch
*(computing)* - Divide and conquer algorithm
*(computing)* - Divide-and-conquer algorithm
*(computing)* - Dykstra's projection algorithm
*(computing)* - Dynamic programming
*(computing)*

### E

- Evolutionary algorithm
*(computing)* - Evolutionary programming
*(computing)* - Exact algorithm
*(computing)* - Expectation–maximization algorithm
*(computing)* - Extremal optimization
*(computing)*

### F

- Fernandez's method
*(computing)* - Fernandez’s method
*(computing)* - Fireworks algorithm
*(computing)* - Fly algorithm
*(computing)* - Fourier–Motzkin elimination
*(computing)* - Fractional programming
*(computing)* - Frank–Wolfe algorithm
*(computing)*

### G

- Gauss–Newton algorithm
*(computing)* - Generalized iterative scaling
*(computing)* - Genetic algorithms in economics
*(computing)* - Genetic improvement (computer science)
*(computing)* - Golden-section search
*(computing)* - Gradient descent
*(computing)* - Gradient method
*(computing)* - Graduated optimization
*(computing)* - Great Deluge algorithm
*(computing)* - Greedy algorithm
*(computing)* - Greedy triangulation
*(computing)* - Guided Local Search
*(computing)*

### H

- Hyper-heuristic
*(computing)*

### I

- In-crowd algorithm
*(computing)* - Interior-point method
*(computing)* - Interval contractor
*(computing)* - IOSO
*(computing)* - IPOPT
*(software)* - Iterated conditional modes
*(computing)* - Iterated local search
*(computing)*

### J

- Job shop scheduling
*(computing)*

### K

- Kantorovich theorem
*(computing)* - Karmarkar's algorithm
*(computing)* - Killer heuristic
*(computing)*

### L

- Lawler's algorithm
*(computing)* - Learning rate
*(computing)* - Least squares
*(computing)* - Lemke's algorithm
*(computing)* - Level-set method
*(computing)* - Levenberg–Marquardt algorithm
*(computing)* - Limited-memory BFGS
*(computing)* - LINCOA
*(computing)* - Line search
*(computing)* - Linear-fractional programming
*(computing)* - Lloyd's algorithm
*(computing)* - Local convergence
*(computing)* - Local search (optimization)
*(computing)* - Luus–Jaakola
*(computing)*

### M

- Matheuristics
*(computing)* - Matrix chain multiplication
*(computing)* - Maximum subarray problem
*(computing)* - MCS algorithm
*(computing)* - Mehrotra predictor–corrector method
*(computing)* - Minimax
*(computing)* - MM algorithm
*(computing)*

### N

- Natural evolution strategy
*(computing)* - Negamax
*(computing)* - Nelder–Mead method
*(computing)* - Network simplex algorithm
*(computing)* - Newton's method
*(computing)* - Newton's method in optimization
*(computing)* - NEWUOA
*(computing)* - Nonlinear conjugate gradient method
*(computing)* - Nonlinear programming
*(computing)*

### O

- Odds algorithm
*(computing)* - Ordered subset expectation maximization
*(computing)*

### P

- Parallel metaheuristic
*(computing)* - Parametric programming
*(computing)* - Pattern search (optimization)
*(computing)* - Penalty method
*(computing)* - Powell's dog leg method
*(computing)* - Powell's method
*(computing)* - PSeven
*(software)*

### Q

- Quadratic programming
*(computing)* - Quantum annealing
*(computing)* - Quasi-Newton inverse least squares method
*(computing)* - Quasi-Newton least squares method
*(computing)* - Quasi-Newton method
*(computing)*

### R

- Random optimization
*(computing)* - Random search
*(computing)* - Robust fuzzy programming
*(computing)* - Rosenbrock methods
*(computing)* - Ruzzo–Tompa algorithm
*(computing)*

### S

- Search-based software engineering
*(computing)* - Second-order cone programming
*(computing)* - Semidefinite embedding
*(computing)* - Sequential linear-quadratic programming
*(computing)* - Sequential minimal optimization
*(computing)* - Sequential quadratic programming
*(computing)* - Simplex algorithm
*(computing)* - Simulated annealing
*(computing)* - Simultaneous perturbation stochastic approximation
*(earth)* - Space allocation problem
*(computing)* - Space mapping
*(computing)* - Special ordered set
*(computing)* - Spiral optimization algorithm
*(computing)* - State transition algorithm
*(computing)* - Stochastic dynamic programming
*(computing)* - Stochastic gradient Langevin dynamics
*(computing)* - Stochastic hill climbing
*(computing)* - Stochastic programming
*(computing)* - Subgradient method
*(computing)* - Successive linear programming
*(computing)* - Successive parabolic interpolation
*(computing)* - Symmetric rank-one
*(computing)*

### T

- Ternary search
*(computing)* - TOLMIN (optimization software)
*(software)* - Tree rearrangement
*(computing)* - Truncated Newton method
*(computing)* - Trust region
*(computing)*

### U

- UOBYQA
*(computing)*

### V

- Very large-scale neighborhood search
*(computing)*

### Z

- Zadeh's rule
*(computing)* - Zadeh's Rule
*(computing)* - Zionts–Wallenius method
*(computing)*