flâneur

EE364a: Convex Optimization I

web.stanford.edu · 913 words · saved by 1 readers

Through the first week, office hours will be by appointment. To schedule an appointment, email Logan or Nikhil. If you're looking for something to do before class starts, you could read Chapter 1 of the textbook, or install CVXPY. If you're really antsy, you could start reading Chapter 2. The course will be on CGOE, so videos of the lectures will be available to enrolled students. Yes, you can take EE364a and another course taught at the same time. The lectures will be recorded, and we will have an alternate time for the final exam. Course assistants: Jaewook (David) Lee Office hours and locations, after the first week, will be announced on Ed. The full set of slides is available as one PDF file here. The original slides, used until Summer 2023, are available here. Some additional material: CVXPY tutorial Convex optimization examples Stochastic programming Chance constrained optimization Filter design and equalization L1 methods for convex-cardinality problems (part I), (part II) Conve

EE364a More EE364a is the same as CME364a. This webpage contains basic course information; up to date and detailed information is on Ed. Announcements Welcome to EE364a, Summer quarter 2025–2026. EE364a will be taught by Logan Bell and Nikhil Devanathan. Lectures are Tuesdays and Thursdays 12:00–2:00PM, Skilling Auditorium. The first lecture is June 23. Through the first week, office hours will be by appointment. To schedule an appointment, email Logan or Nikhil. If you're looking for something to do before class starts, you could read Chapter 1 of the textbook, or install CVXPY. If…

saved by

related reading