Relaxation methods for problems with strictly convex separable costs and linear constraints

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2936

Full metadata record

DC Field	Value	Language
dc.contributor	Tseng, Paul.	-
dc.contributor	Bertsekas, Dimitri P.	-
dc.date	2003-04-29T15:27:03Z	-
dc.date	2003-04-29T15:27:03Z	-
dc.date	1986	-
dc.date.accessioned	2013-06-04T16:15:44Z	-
dc.date.available	2013-06-04T16:15:44Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/2936	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	by Paul Tseng, Dimitri P. Bertsekas.	-
dc.description	Bibliography: p. 25-26.	-
dc.description	National Science Foundation grant NSF-ECS-3217668	-
dc.format	26 p.	-
dc.format	1142928 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]	-
dc.relation	LIDS-P ; 1567	-
dc.subject	TK7855.M41 E3845 no.1567	-
dc.title	Relaxation methods for problems with strictly convex separable costs and linear constraints	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI