Robust Optimization: Polynomial Optimization

Related lectures (44)

Covers linear applications, matrices, transformations, and the principle of superposition.

Covers the analysis of the column space of a matrix and its implications.

Explores dual cones, generalized inequalities, SDP duality, and KKT conditions in convex optimization.

Covers the KKT conditions and Slater's condition in convex optimization problems.

Covers the fundamentals of linear equations, matrices, and systems of linear equations, including matrix operations and solutions.

Explores problems with generalized inequalities in convex optimization and the equivalence between SOCP and SDP.

Explores the properties of invertible matrices, including unique solutions and linear independence.

Explores the exponential of a matrix, properties, Frobenius norm, nilpotent matrices, commutativity, and system solutions.

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

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

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

Covers linear equations, characteristic polynomials, solutions, and matrices with operations like addition and multiplication.

Introduces dynamic programming with a focus on rod cutting and matrix chain multiplication.

Explores the properties and applications of matrix transpose, including rotations and inverse matrices.

Examines conditions for the existence of invertible matrices satisfying specific matrix equations involving eigenvalues.

Covers the composition and product of matrices, including matrix multiplication.

Covers the concept of basis, linear transformations, matrices, inverses, determinants, and bijective transformations.

Covers matrix product, inverses, and properties of invertible matrices.

Covers the basics of Numpy, including importing the library, creating arrays, and performing linear algebra operations.

Covers the matrix exponential, its convergence properties, and the Jordan normal form.

Page 2 of 3