Skip to content
Convex (and non-convex) Optimization episode artwork

EPISODE · Dec 17, 2018 · 20 MIN

Convex (and non-convex) Optimization

from Linear Digressions · host Katie Malone

Convex optimization is one of the keys to data science, both because some problems straight-up call for optimization solutions and because popular algorithms like a gradient descent solution to ordinary least squares are supported by optimization techniques. But there are all kinds of subtleties, starting with convex and non-convex functions, why gradient descent is really an optimization problem, and what that means for your average data scientist or statistician.

Episode metadata supplied by the publisher feed · Published Dec 17, 2018

Embed this episode

Ready to play

Convex (and non-convex) Optimization

0:00 20:00

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Linear Digressions?

This episode is 20 minutes long.

When was this Linear Digressions episode published?

This episode was published on December 17, 2018.

Can I download this Linear Digressions episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!