A simple polynomial-time algorithm for convex quadratic programming

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

Full metadata record

DC Field	Value	Language
dc.contributor	Tseng, Paul.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:31:53Z	-
dc.date	2003-04-29T15:31:53Z	-
dc.date	1988	-
dc.date.accessioned	2013-06-04T16:16:06Z	-
dc.date.available	2013-06-04T16:16:06Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3092	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Paul Tseng.	-
dc.description	Caption title.	-
dc.description	Includes bibliographical references.	-
dc.description	This research is partially supported by the U.S. Army Research Office (Center for Intelligent Control Systems), contract DAAL03-86-K-0171 This research is partially supported by the National Science Foundation grant NSF-ECS-8519058	-
dc.format	12 leaves	-
dc.format	733530 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]	-
dc.relation	LIDS-P ; 1819	-
dc.subject	TK7855.M41 E3845 no.1819, 1988	-
dc.title	A simple polynomial-time algorithm for convex quadratic programming	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI