An algorithm, called forward improvement iteration, is presented by which an optimal stopping time can be computed. Using an iterative step, this algorithm computes a sequence B⁰ = Bⁱ = B2 =... of ...

The algorithm's efficient polynomial complexity allows it to scale with system size, which is essential as quantum computers become more powerful.

We describe the cyclic coordinate-exchange algorithm for constructing D-optimal and linear-optimal experimental designs. The algorithm uses a variant of the Gauss-Southwell cyclic coordinate-descent ...

An optimal stopping algorithm takes all that indecision away. This may all sound very impersonal as a way to find a partner, but math has been used to locate love.