Similar to 局所探索法

Broyden–Fletcher–Goldfarb–Shanno algorithm

Berndt–Hall–Hall–Hausman algorithm

CMA-ES

Limited-memory BFGS

Symmetric rank-one

Affine scaling

Alpha–beta pruning

Simulated annealing

1 + 1 + 1 + 1 + ⋯

1/2 + 1/4 + 1/8 + 1/16 + ⋯

1/2 − 1/4 + 1/8 − 1/16 + ⋯

1/4 + 1/16 + 1/64 + 1/256 + ⋯

Hundredth

Courant–Friedrichs–Lewy condition

E (complexity)

ESPACE

Great Internet Mersenne Prime Search

0

1

2

3

4

5

6

7

8

9