Extreme Values and Optimization

Related lectures (49)

Discusses proximal gradient descent and its applications in optimizing machine learning algorithms.

Delves into optimizing purely functional priority queues, exploring binomial and skew binomial queues, global roots, and practical implementations.

Covers stochastic models for communications, focusing on queueing theory with an in-depth analysis of the M/G/1 queue.

Explores dynamic programming with Bellman-Ford, Dijkstra, greedy strategies, and activity scheduling problems.

Explores dynamic programming for optimizing decision-making processes over time, using real-world examples like oil extraction and stock trading.

Covers faster gradient descent methods and projected gradient descent for constrained optimization in machine learning.

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.

Explores the Augmented Lagrangian Method with equality and inequality constraints in optimization, emphasizing the importance of slack variables.

Explores convexifying nonconvex problems through SVM and dimensionality reduction techniques.

Page 3 of 3