Dual subgradients and the drift-plus-penalty method (Stochastic optimization Convex Optimization (Non-linear))

From Algorithm Wiki
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(Vmn)$???? words (involves minimizing an expression with up to O(Vmn) terms per iteration?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1993 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(Vmn)$???? words

(involves minimizing an expression with up to O(Vmn) terms per iteration?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1993

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dual_subgradients_and_the_drift-plus-penalty_method_(Stochastic_optimization_Convex_Optimization_(Non-linear))&oldid=45290"