Primal-dual Optimization III: Lagrangian Gradient Methods

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (29)

Page 3 of 3

Explores Lagrangian duality in convex optimization, transforming problems into min-max formulations and discussing the significance of dual solutions.

Stochastic Gradient Descent: Optimization and Convergence

Explores stochastic gradient descent, covering convergence rates, acceleration, and practical applications in optimization problems.

KKT for convex problems and Slater's CQ

Covers the KKT conditions and Slater's condition in convex optimization problems.

Convex Optimization: Convex Functions

Covers the concept of convex functions and their applications in optimization problems.

Structures in Non-Convex Optimization

Delves into structures in non-convex optimization, emphasizing scalable optimization for deep learning.

Optimization Techniques: Convexity and Algorithms in Machine Learning

Covers optimization techniques in machine learning, focusing on convexity, algorithms, and their applications in ensuring efficient convergence to global minima.

Primal-dual Optimization: Algorithms and Convergence

Explores primal-dual optimization algorithms for convex-concave minimax problems, discussing convergence properties and applications.

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

Convex Optimization: Dual Cones

Explores dual cones, generalized inequalities, SDP duality, and KKT conditions in convex optimization.