Lectures related to Primal-dual Optimization II

Semidefinite Programming: Formulations and Applications

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

Primal-dual Optimization III: Lagrangian Gradient Methods

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

Primal-dual optimization: Theory and Computation

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

Nonconvex Optimization: Challenges and Strategies

Explores nonconvex optimization challenges and strategies, including blind image deconvolution and SDP relaxations.

The Hidden Convex Optimization Landscape of Deep Neural Networks

Explores the hidden convex optimization landscape of deep neural networks, showcasing the transition from non-convex to convex models.

Primal-dual Optimization: Fundamentals

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

Optimization Techniques: Convexity in Machine Learning

Covers optimization techniques in machine learning, focusing on convexity and its implications for efficient problem-solving.

Adversarial Machine Learning: Fundamentals and Techniques

Explores adversarial machine learning, covering the generation of adversarial examples, robustness challenges, and techniques like Fast Gradient Sign Method.

Optimization Methods in Machine Learning

Explores optimization methods in machine learning, emphasizing gradients, costs, and computational efforts for efficient model training.

Optimization with Constraints: KKT Conditions

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Primal-dual Optimization: Extra-Gradient Method

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

Optimality Conditions in Linear Optimization MOOC: Optimization: principles and algorithms - Linear optimization

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

Structures in Non-Convex Optimization

Covers non-convex optimization, deep learning training problems, stochastic gradient descent, adaptive methods, and neural network architectures.

Linear Programming: Weighted Bipartite Matching

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

Optimality of Convergence Rates: Accelerated/Stochastic Gradient Descent

Covers the optimality of convergence rates in accelerated and stochastic gradient descent methods for non-convex optimization problems.

Primal-dual Optimization: Lagrangian Methods

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

Supervised Learning Overview

Covers CNNs, RNNs, SVMs, and supervised learning methods, emphasizing the importance of tuning regularization and making informed decisions in machine learning.

Convex Optimization Tutorial: KKT Conditions Log in to Mediaspace to watch this video

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

Optimization Techniques: Convexity and Algorithms in Machine Learning Log in to Mediaspace to watch this video

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

KKT and Convex Optimization Log in to Mediaspace to watch this video

Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.