From 05072094652d9587c22364d50ab8f004479ca900 Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Mon, 11 Feb 2013 20:21:42 -0800
Subject: Small fix

---
 main.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'main.tex')

diff --git a/main.tex b/main.tex
index 469995d..55df8fe 100644
--- a/main.tex
+++ b/main.tex
@@ -90,7 +90,7 @@ The function $L$ is well-known to be concave and even self-concordant (see
 method for self-concordant functions in \cite{boyd2004convex}, shows that
 finding the maximum of $L$ to any precision $\varepsilon$ can be done in
 $O(\log\log\varepsilon^{-1})$ iterations. Being the solution to a maximization
-problem, $L^*$ satisfies the required monotonicity property. The main challenge
+problem, $OPT'_{-i^*}$ satisfies the required monotonicity property. The main challenge
 will be to prove that $OPT'_{-i^*}$, for our relaxation $L$, is close to
 $OPT_{-i^*}$. 
 
-- 
cgit v1.2.3-70-g09d2