7 search results - page 2 / 2 » orl 2011 |
ORL
2011
12 years 12 months ago
2011
We consider the problem of stock repurchase over a finite time horizon. We assume that a firm has a reservation price for the stock, which is the highest price that the firm is ...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...