Sign inSign in
ConceptEngineering

Backtracking line search

A line search method starting at t equals 1 and repeatedly multiplying by beta until the Armijo condition is satisfied.
as Stephen Boyd defines itStanford University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Gilbert Strang

    MIT · Undergraduate

    A line search technique that starts with a tentative step size and iteratively reduces it until a sufficient decrease condition is satisfied.
    • 38:07Gradient Descent: Downhill to a Minimum

Lectures that assume it

1

Connections

10

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.