We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm

Thumbnail Image
Download
Name

OR-321-97-42269813.pdf

Size

1.56 MB

Format

Adobe PDF

Checksum (MD5)

0dbcf524284294629928066a575804c8

Date Issued
1997
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Working paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 321-97.
Description
"September 1997."
Includes bibliographical references (p. 28-29).
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.