CO466/666/CM741
Fall 2021
Continuous Optimization
(This webpage is still in preparation)
Instructor
Henry Wolkowicz
(MC6065, x35589)
- Handouts
-
Syllabus 2021
Course/Marking
- Links/Announcements
-
A "new" algorithm that minimizes anything/everything
-
Previous lecture outlines (currently from W09)
-
Lecture Times: 10:00-11:20PM, MW (begins Wed. Sept 8/21)
-
Location:
MC4060
-
Office Hours: TBA
-
TA Matthew Kroeker, Office Hours: TBA
-
Course Outline (see the
Syllabus 2021
link on the right)
The course covers the fundamentals of continuous optimization in
Euclidean spaces, i.e.,
the problem of minimizing (or maximizing) a given continuous function of
finitely many real variables, subject to constraints described as
equations and inequalities involving
other continuous functions. We emphasize the roles of:
theory, algorithmic development, applications, and implementation
.
-
Final Exam: TBA:
Marking Information
Instructor Henry Wolkowicz (MC6065, x35589)
- Handouts
- Syllabus 2021 Course/Marking
- Links/Announcements
- A "new" algorithm that minimizes anything/everything
- Previous lecture outlines (currently from W09)
- Lecture Times: 10:00-11:20PM, MW (begins Wed. Sept 8/21)
- Location: MC4060
- Office Hours: TBA
- TA Matthew Kroeker, Office Hours: TBA
-
Course Outline (see the
Syllabus 2021
link on the right)
-
The course covers the fundamentals of continuous optimization in
Euclidean spaces, i.e.,
the problem of minimizing (or maximizing) a given continuous function of
finitely many real variables, subject to constraints described as
equations and inequalities involving
other continuous functions. We emphasize the roles of:
theory, algorithmic development, applications, and implementation . - Final Exam: TBA: Marking Information
Last Modified: Saturday 14 August 2021
