EEE461 Numerical Optimization

Updated:


lecture notes: Lecture Notes on Numerical Optimization, Moritz Diehl

course based on: Numerical Optimization, Moritz Diehl

DERS UYGULAMA BELGESİ (SYLLABUS)

weekly schedule

Week Part Topic
1 fundamental concepts introduction to optimization
2 fundamental concepts types of optimization problems
3 fundamental concepts convex optimization
4 fundamental concepts Lagrangian function and duality
5 unconstrained optimization optimality conditions for unconstrained problems
6 unconstrained optimization estimation and fitting problems
7   review and preparation for the exam (midterm)
midterm week   midterm exam
8 unconstrained optimization gradient descent, Newton-type methods
9 unconstrained optimization globalization strategies
10 unconstrained optimization calculating derivatives
11 constrained optimization optimality conditions for equality constrained problems
12 constrained optimization equality constrained optimization algorithms
13 constrained optimization optimality conditions for inequality constrained problems
14 constrained optimization inequality constrained optimization algorithms
15 constrained optimization optimal control
16   review and preparation for the exam (final)

Resources

Textbooks

An Introduction to Optimization (Chong&Zak)

Convex Optimization (Boyd&Vandenberghe)

Numerical Optimization (Nocedal&Wright)

Constrained Optimization and Lagrange Multiplier Methods (Bertsekas)

Convex Optimization Theory (Bertsekas)

Convex Optimization Algorithms (Bertsekas)

Computational Optimization Open Textbook (Cornell University)

Convex Optimization: Algorithms and Complexity (Bubeck)

Youtube playlists

Introduction to Applied Linear Algebra (Stephen Boyd)

Convex Optimization (Stephen Boyd)

Optimization (Christopher Lum)

Convex Optimization (Visually Explained)

Leave a Comment