Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2936| Title: | Relaxation methods for problems with strictly convex separable costs and linear constraints |
| Authors: | Tseng, Paul. Bertsekas, Dimitri P. |
| Keywords: | TK7855.M41 E3845 no.1567 |
| Issue Date: | 5-Jun-2013 |
| Publisher: | Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] |
| Description: | by Paul Tseng, Dimitri P. Bertsekas. Bibliography: p. 25-26. National Science Foundation grant NSF-ECS-3217668 |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/2936 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.