Slide: Short-step barrier method algorithm (parameters   (0, 1),  = 1/8)  repeat until 2/t  : t := properties  increases t slowly so x stays in region of quadratic region (t(x)  )    log t0 1+  select initial x and t with t(x)   1  t, 1+8   x := x  ft(x)1ft(x)   iteration complexity  #iterations = O   best known worst-case complexity; same as for linear programming Barrier methods 91
{}