1
Assuntos:
“...Iteration-complexity bound...”
Subgradient and gradient methods with feasible inexact projections for constrained convex optimization problems
Tese