Convex Optimization · Problem 9.22

Equality constrained minimization — Boyd & Vandenberghe

Mathematics — Optimization · newton-steps-bound-epsilon-accuracy

Problem

Suppose that

f

is strictly convex and satisfies (9.42). Give a bound on the number of Newton steps required to compute

p^\star

within

\epsilon

, starting at

x^{(0)}