Save this video free

Lecture 15: Non-linear least-squares (cont); Convexity

Burton Ma · 50:40 · Watch on YouTube

Part of Queen's University CISC 371. See all 17 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

Burton Ma connects Gauss-Newton nonlinear least squares to multilateration: distances from known landmarks define a position-estimation problem, which he formulates with residuals and Jacobians and demonstrates in MATLAB using four landmarks and noisy measurements. He then develops multivariate convexity through chord and tangent-plane definitions, convex functions and norms, and convex sets built from half-spaces and level sets.

Key takeaways

Chapters

0:00 Gauss-Newton Recap and Multilateration Geometry
5:28 Writing Landmark Localization as Nonlinear Least Squares
8:47 MATLAB Demonstration with Four Noisy Landmarks
16:13 Monotonicity Does Not Guarantee Convexity
20:19 Extending the Chord Definition of Convexity to Multiple Variables
24:16 Linear and Affine Maps, Quadratic Forms, and Convexity Rules
31:36 Norms Are Convex by Homogeneity and the Triangle Inequality
38:46 Convex Functions Lie Above Their Tangent Hyperplanes
42:00 Convex Sets, Half-Spaces, and Intersections
48:37 Level Sets, Sub-Level Sets, and Super-Level Sets

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:02 All right, good morning everybody. So, picking up where we left off from last day, we were talking about non-linear squares and we're talking about the Gauss-Newton algorithm for solving a non-linear squares problem. So, remember non-linear squares, you're trying to solve an objective function that you're trying to minimize, sorry, an objective function that looks like the sum over n values y i minus some function squared. Right, so it's a squared objective function. x i are your independent variables, your y i's are your dependent variables,

0:50 and so your non-linear model relates your observations to your model parameters w. And your independent observations via some non-linear function f. Right? Now, because this thing is non-linear it becomes difficult or impossible to find a least to find an analytic solution to this problem. So, instead what you do is you one approach that you can take is that you can linearize this thing. And when you linearize it using a Taylor series of first order Taylor series approximation you crunch through all the math, you end up with a least squares problem. Which you can now solve over and over and over again until you converge to a solution. And so, in the least squares problem

1:39 the oops, this term these terms here right, that looks like the normal equations for a regular least squares problem or for a linear least squares problem. And in fact, it is the equivalent of the normal equations. It's just now that you're using the Jacobians of the functions. Oh, sorry. Um and you can plug that solution into any uh That's the gradient. So, you can plug that's the sorry, the gradient is boom boom boom boom Uh we had an expression for the gradient somewhere. Oh, I'm sorry. That is the gradient. Let

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Burton Ma.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.