Revision as of 12:16, 2 December 2016 edit Vvalls (talk \| contribs) 3 edits →Lower bounds on the solution value, and primal-dual analysis Tag: Visual edit ← Previous edit		Revision as of 12:18, 2 December 2016 edit undo Vvalls (talk \| contribs) 3 edits →Lower bounds on the solution value, and primal-dual analysis: Expanded equation for clarity Tag: Visual edit Next edit →
Line 34: ==Lower bounds on the solution value, and primal-dual analysis== Since <math>f</math> is [[Convex function\|convex]], for any two points <math>\mathbf{x}, \mathbf{y} \in \mathcal{D}</math> we have: :<math>

Frank–Wolfe algorithm: Difference between revisions