Show simple item record

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

dc.contributorFreund, Robert M.en_US
dc.contributorVera, Jorge R.en_US
dc.contributorMassachusetts Institute of Technology. Operations Research Centeren_US
dc.date.accessioned2004-05-28T19:30:13Z
dc.date.available2004-05-28T19:30:13Z
dc.date.issued1997en_US
dc.identifier.otherOR 321-97en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5253
dc.description"September 1997."en_US
dc.descriptionIncludes bibliographical references (p. 28-29).en_US
dc.description.statementofresponsibilityby R.M. Freund and J.R. Vera.en_US
dc.format.extent29 p. : ill.en_US
dc.format.extent1638805 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesWorking paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 321-97.en_US
dc.subject.lccQ175.M41 O616 no.321-97en_US
dc.titleCondition-based complexity of convex optimization in conic linear form via the ellipsoid algorithmen_US


Files in this item

Thumbnail
Name:
OR-321-97-42269813.pdf
Size:
1.562Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record