Lecture

Primal-dual Optimization: Methods and Applications

Related lectures (30)

Primal-dual Optimization: Extra-Gradient Method

Explores the Extra-Gradient method for Primal-dual optimization, covering nonconvex-concave problems, convergence rates, and practical performance.

Primal-dual optimization: Theory and Computation

Explores primal-dual optimization, conjugation of functions, strong duality, and quadratic penalty methods in data mathematics.

Primal-dual Optimization: Fundamentals

Explores primal-dual optimization, minimax problems, and gradient descent-ascent methods for optimization algorithms.

Linear Programming Techniques in Reinforcement Learning

Covers the linear programming approach to reinforcement learning, focusing on its applications and advantages in solving Markov decision processes.

Optimization Methods: Convergence and Trade-offs

Covers optimization methods, convergence guarantees, trade-offs, and variance reduction techniques in numerical optimization.

Optimal Control: KKT Conditions

Explores optimal control and KKT conditions for non-linear optimization with constraints.

Optimization Methods: Theory Discussion

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Primal-dual Optimization: Lagrangian Methods

Explores primal-dual optimization with a focus on Lagrangian methods and their convergence, drawbacks, and enhancements.

Primal-dual Optimization: Algorithms and Convergence

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

Introduction to Optimization

Introduces linear algebra, calculus, and optimization basics in Euclidean spaces, emphasizing the power of optimization as a modeling tool.

Primal-dual Optimization III: Lagrangian Gradient Methods

Explores primal-dual optimization methods, emphasizing Lagrangian gradient techniques and their applications in data optimization.

Minimax Optimization: Theory and Algorithms

Explores minimax optimization theory, including weak and strong duality, saddle points, and practical algorithm performance.

Convex Optimization Tutorial: KKT Conditions

Explores KKT conditions in convex optimization, covering dual problems, logarithmic constraints, least squares, matrix functions, and suboptimality of covering ellipsoids.

Convex Optimization: Exercises

Covers exercises on convex optimization, focusing on formulating and solving optimization problems using YALMIP and solvers like GUROBI and MOSEK.

Optimization: Mathematical Principles and Algorithms

Covers mathematical principles and algorithms of optimization, using real-world examples and Python implementation.

Gradient Descent Methods: Theory and Computation

Explores gradient descent methods for smooth convex and non-convex problems, covering iterative strategies, convergence rates, and challenges in optimization.

Optimization Duality: Theory and Algorithms

Explores optimization duality, weak and strong duality, practical optimization algorithms, and challenges in nonconvex-concave problems.

Primal-dual Optimization II

Explores primal-dual optimization methods, focusing on Lagrangian approaches and various methods like penalty, augmented Lagrangian, and splitting techniques.

Optimization Techniques: Stochastic Gradient Descent and Beyond

Discusses optimization techniques in machine learning, focusing on stochastic gradient descent and its applications in constrained and non-convex problems.

Introduction to Optimization

Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.