Lecture

Primal-dual Optimization

Related lectures (32)

Primal-dual optimization: Theory and Computation

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

Linear Optimization: Finding Initial BFS

Explains the process of finding an initial Basic Feasible Solution for linear optimization problems using the Simplex Algorithm.

Primal-dual Optimization: Fundamentals

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

Optimality Conditions in Linear Optimization

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

Duality in Linear Programming

Explores the concept of duality in linear programming, discussing the relationship between primal and dual problems.

Linear Optimization: Auxiliary Problem

Explores the formulation of the auxiliary problem in linear optimization and its role in optimal decision-making.

Linear Programming Duality

Explores Linear Programming Duality, covering weak duality, strong duality, Lagrange multipliers interpretation, and optimization constraints.

Linear Programming Duality

Covers linear programming duality and complementary slackness condition.

Optimal Decision Making: Sensitivity Analysis

Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

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.

Duality: Economic Interpretation

Explores duality in linear programming, strong duality, complementary slackness, and the economic interpretation of dual variables as prices.

Lagrangian Duality: Theory and Applications

Explores Lagrangian duality in convex optimization, discussing strong duality, dual solutions, and practical applications in second-order cone programs.

Lagrangian Duality: Convex Optimization

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

Linear Programming: Two-phase Simplex Algorithm

Covers the application of the two-phase Simplex algorithm to solve linear programming problems.

Linear Programming: Weighted Bipartite Matching

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

Primal-dual Optimization: Extra-Gradient Method

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

Linear Programming Duality

Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.

Dual Translations in Linear Programming

Explores dual translations in linear programming, emphasizing primal and dual formulations and the significance of invertible submatrices.

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.