Wolfe; Lemaréchal; Kiwiel (General, Constrained 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^{4})$ == Space Complexity == $O(n+L)$?? words (keeps track of current guess x^{(k)}, and computes bundle G^{(k)}, direction d^{(k)}, and scalar t^{(k)}?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1964 == Reference == https://link.springer.com/content/pdf/10.1007/BFb0120703.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{4})$

Space Complexity

$O(n+L)$?? words

(keeps track of current guess x^{(k)}, and computes bundle G^{(k)}, direction d^{(k)}, and scalar t^{(k)}?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1964

Reference

https://link.springer.com/content/pdf/10.1007/BFb0120703.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Wolfe;_Lemaréchal;_Kiwiel_(General,_Constrained_optimization_Convex_Optimization_(Non-linear))&oldid=45287"