Descent methods and line search: Quadratic interpolation

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (31)

Interpolation de Lagrange

Covers Lagrange interpolation, focusing on constructing polynomials that pass through given points.

Newton's Method: Optimization & Indefiniteness

Covers Newton's Method for optimization and discusses the caveats of indefiniteness in optimization problems.

Numerical Differentiation: Methods and Errors

Explores numerical differentiation methods and round-off errors in computer computations.

Nonlinear Equations: Interpolation and Error Analysis

Covers the interpolation of nonlinear functions using Lagrange polynomials and error analysis.

Numerical Analysis: Introduction to Interpolation Techniques

Covers the basics of numerical analysis, focusing on interpolation methods and their applications in engineering.

Piecewise Linear Interpolation

Covers the concept of piecewise linear interpolation and the importance of dividing intervals correctly.

Untitled

Gradient Descent

Covers the concept of gradient descent in scalar cases, focusing on finding the minimum of a function by iteratively moving in the direction of the negative gradient.

Interpolation: Lagrange polynomial and error analysis

Covers the interpolation of functions using Lagrange polynomials and error analysis, emphasizing the dependence on the function.

Descent Methods and Newton Method with Line Search

Covers the comparison between descent methods and Newton's method, modifications, line search, and convergence analysis.

Quasi-Newton Methods

Introduces Quasi-Newton methods for optimization, explaining their advantages over traditional approaches like Gradient Descent and Newton's Method.

Page 2 of 2