Convex Optimization: Self-dual Cones

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (31)

Page 3 of 4

Optimization in Networks

Explores duality in network optimization problems with examples and step-by-step explanations.

Convex Optimization: Introduction and Sets

Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.

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.

Convex Optimization: Exercises

Covers exercises related to convex optimization, including SOCP dual, KKT conditions, and equality constrained least squares.

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

Convex Optimization

Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.

Optimization Problems: Standard Form

Explores optimization problems in standard form, convex optimization, and optimality criteria.

Convex Optimization Problems: Theory and Applications

Explores convex optimization problems, optimality criteria, equivalent problems, and practical applications in transportation and robotics.

Primal-dual optimization: Theory and Computation

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