EE364A.stanford.edu

Lecture

• SU-EE364a JAN062026
• SU-EE364A JAN082026
• SU-EE364A JAN132026
• SU-EE364A JAN152026
• SU-EE364A JAN202026
• SU-EE364A JAN222026
• SU-EE364A JAN272026
• SU-EE364A FEB052026
• SU-EE364A FEb102026
• SU-EE364A FEB022026
• SU-EE364A FEb192026
• SU-EE364A FEB242026
• SU-EE364A FEB262026
• SU-EE364A MAR032026
• SU-EE364A MAR102026

Because cursed languages work best together. Repo is here.

Some Motivation

We wanted an Emacs OS, but that required implementing libc syscalls and also just getting glib to compile, which is obviously not happening. Instead we are going for the second-best thing, which is to be able to interactively write an OS in Emacs.

And thus this project essentially involves enabling the process of incremental development of an operating system kernel. That is, beyond the bare basics and the important, atomic things, everything else should be able to be written and interpreted as they are written (e.g., instead of being compiled into the kernel before).

if we are within the feasible set already, we can do these to prevent us form getting out:

inequality constrained optimization

Generally things are of t]shape:

\begin{align} \min_{x}\quad & f_{0}\qty(x) \\ \textrm{s.t.} \quad & f_{i}\qty(x) \leq 0, i = 1\dots m \\ & Ax =b \end{align}

• convex, tie differentiable
• \(p^{*}\) is finite and attained
• strictly feasible

These include… LP, QP, QCQP, geometric program.

indicator barrier

Reformulate:

\begin{align} \min_{x}\quad & f_{0}\qty(x) + \sum_{i=1}^{m} I_{-}\qty(f_{i}\qty(x)) \\ \textrm{s.t.} \quad & Ax = b \end{align}