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