Frank-Wolfe Algorithm - Changing Solution Previous Next
The equation for the line segment between (0, 0) and (2, 1) is
Since , the values of  on the line are
The point  on this line segment having the largest  is found by maximizing  over  by the one-dimensional search procedure, which yields .
Therefore the new trial solution is .