Example: stock market
Algorithms for Convex Optimization
lems. The fastest known algorithms for problems such as maximum flow in graphs, maximum matching in bipartite graphs, and submodular function min-imization, involve an essential and nontrivial use of algorithms for convex op-timization such as gradient descent, mirror descent, interior point methods, and cutting plane methods.
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: