Covers the fundamentals of Nonlinear Programming and its applications in Optimal Control, exploring techniques, examples, optimality definitions, and necessary conditions.
Covers the fundamentals of convex optimization, including mathematical problems, minimizers, and solution concepts, with an emphasis on efficient methods and practical applications.
Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.
Explores Sum of Squares polynomials and Semidefinite Programming in Polynomial Optimization, enabling the approximation of non-convex polynomials with convex SDP.