Primal-dual Optimization: Methods and Applications

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Convex Sets: MGT-418 Lecture

On Convex Optimization covers course organization, mathematical optimization problems, solution concepts, and optimization methods.

Approximation Algorithms

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Implicit Bias in Machine Learning

Explores implicit bias, gradient descent, stability in optimization algorithms, and generalization bounds in machine learning.

Optimality of Convergence Rates: Accelerated Gradient Descent

Explores the optimality of convergence rates in convex optimization, focusing on accelerated gradient descent and adaptive methods.

Optimality Conditions in Linear Optimization

Covers optimality conditions, strong duality, and complementarity slackness in linear optimization.

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.

Optimization Principles

Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Semidefinite Programming: Formulations and Applications

Explores Semidefinite Programming formulations, SDP relaxations, and optimization strategies with convergence guarantees.

Page 2 of 2