2 This formulation shows that both terms of this objective can be seen as a maximum of linear functions of either W s or a p .
our objective is convex with respect to either W s or a p , thus can be efficiently minimized by using the projected gradient descent algorithm.