AutoMovie API
    Preparing search index...

    How the region moves: a step is taken where the ratio of the actual to the predicted decrease exceeds eta, and the region shrinks by shrink on every step not taken, at most tries times a convexification; a step taken shrinks the region where its ratio is below low and grows it by expand, to widest, where its ratio exceeds high (on a step at the boundary when boundary holds), Nocedal and Wright's Algorithm 4.1 in its general form.

    interface ISchedule {
        boundary: boolean;
        eta: number;
        expand: number;
        high: number;
        improved: (merit: number) => number;
        least: number;
        low: number;
        shrink: number;
        tries: number;
        trust: number;
        widest: number;
    }
    Index
    boundary: boolean

    Whether the region grows only on a step that reaches its boundary.

    eta: number

    The ratio a step must exceed to be taken.

    expand: number

    The region's factor where it grows.

    high: number

    The ratio above which a step taken grows the region.

    improved: (merit: number) => number

    The predicted decrease below which the solve has settled.

    Type Declaration

      • (merit: number): number
      • Parameters

        • merit: number

          The merit at the iterate.

        Returns number

        The decrease.

    least: number

    A region or a step below which the solve has settled.

    low: number

    The ratio below which a step taken shrinks the region.

    shrink: number

    The region's factor where it shrinks.

    tries: number

    Steps tried per convexification at most, the region shrinking between them.

    trust: number

    The region's first half-width, set again at each penalty.

    widest: number

    The widest the region grows.