Subgradient method (General, Constrained optimization Convex Optimization (Non-linear))
Jump to navigation
Jump to search
Time Complexity
$O(n^{2} )$
Space Complexity
$O(n+L)$? words
(keep track of current guess x^{(k)}, and needs to compute subgradient g^{(k)})
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1981
Reference
https://www-springer-com.ezproxy.canberra.edu.au/gp/book/9783642821202