Stanford Root

Schedule

Stanford Root

Schedule

CS 361

Engineering Design Optimization (AA 222, CME 222)

UNITS:3-4
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

Design of engineering systems within a formal optimization framework. This course covers the mathematical and algorithmic fundamentals of optimization, including derivative and derivative-free approaches for both linear and non-linear problems, with an emphasis on multidisciplinary design optimization. Topics will also include quantitative methodologies for addressing various challenges, such as accommodating multiple objectives, automating differentiation, handling uncertainty in evaluations, selecting design points for experimentation, and principled methods for optimization when evaluations are expensive. Applications range from the design of aircraft to automated vehicles. Prerequisites: some familiarity with probability, programming, and multivariable calculus.

Syllabus for selected term:
View Spring 2027 Syllabus

Sections

1 Term
Lecture 1Open
ID: 1874
0 / 999 enrolled
DAYS:Tuesday, Thursday
TIME:9 AM – 10:20 AM
LOCATION:TBD
INSTRUCTOR:
Kochenderfer, Mykel, Bruvik, Olivia, Lasic-Ellis, Ian, Tzikas, Alexandros, Baker, Kate+3 more
units

CS 361: Engineering Design Optimization (AA 222, CME 222)

3-4 units · Letter or Credit/No Credit

Design of engineering systems within a formal optimization framework. This course covers the mathematical and algorithmic fundamentals of optimization, including derivative and derivative-free approaches for both linear and non-linear problems, with an emphasis on multidisciplinary design optimization. Topics will also include quantitative methodologies for addressing various challenges, such as accommodating multiple objectives, automating differentiation, handling uncertainty in evaluations, selecting design points for experimentation, and principled methods for optimization when evaluations are expensive. Applications range from the design of aircraft to automated vehicles. Prerequisites: some familiarity with probability, programming, and multivariable calculus.

Offered in Spring 2027 at Stanford University.

Spring 2027 sections

  • Lecture — Tuesday Thursday 9:00 AM – 10:20 AM — Kochenderfer, Mykel, Bruvik, Olivia, Lasic-Ellis, Ian, Tzikas, Alexandros, Baker, Kate, Wang, Jun, Liu, Houjun, Narayanaswamy, Chetan Reddy (Graduate)

More CS courses

  • CS 355: Advanced Topics in Cryptography
  • CS 356: Topics in Computer and Network Security
  • CS 357S: Formal Methods for Computer Systems
  • CS 359D: Quantum Complexity Theory
  • CS 359E: Quantum Complexity Theory
  • CS 360: Simplicity and Complexity in Economic Theory (ECON 284)
  • CS 372: Artificial General Intelligence for Reasoning, Planning, and Decision Making
  • CS 375: Large-Scale Neural Network Modeling for Neuroscience (PSYCH 249)
  • CS 377G: Designing Serious Games
  • CS 377P: Read, Write, Play
  • CS 377Q: Designing for Accessibility (ME 214)
  • CS 377U: Understanding Users

All CS courses · All departments