DSpace Repository
Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm
Login
English
العربية
DSpace Home
→
Harvested articles مقالات مستوردة من مؤسسات وجامعات عالمية
→
MIT Items
→
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm
Freund, Robert M.; Vera, Jorge R.; Massachusetts Institute of Technology. Operations Research Center
URI:
http://koha.mediu.edu.my:8181/xmlui/handle/1721
Date:
2013-10-09
Description:
by R.M. Freund and J.R. Vera.
"September 1997."
Includes bibliographical references (p. 28-29).
Show full item record
Files in this item
Files
Size
Format
View
There are no files associated with this item.
This item appears in the following Collection(s)
MIT Items
Search DSpace
Search DSpace
This Collection
Advanced Search
Browse
All of DSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
My Account
Login
Register