Show simple item record

dc.contributor.authorZhang, Yin
dc.date.accessioned 2018-06-18T17:47:05Z
dc.date.available 2018-06-18T17:47:05Z
dc.date.issued 1998-06
dc.identifier.citation Zhang, Yin. "An Interior-Point Algorithm for the Maximum-Volume Ellipsoid Problem." (1998) https://hdl.handle.net/1911/101901.
dc.identifier.urihttps://hdl.handle.net/1911/101901
dc.description.abstract In this report, we consider the problem on finding the maximum-volume ellipsoid inscribing a given full-dimensional polytope in R^n defined by a finite set of affine inequalities. We present several formulations for the problem that may serve as algorithmic frameworks for applying interior-point methods. We propose a practical interior-point algorithm based on one of the formulations and present preliminary numerical results.
dc.format.extent 16 pp
dc.title An Interior-Point Algorithm for the Maximum-Volume Ellipsoid Problem
dc.type Technical report
dc.date.note June 1998 (Revised April 1999)
dc.identifier.digital TR98-15
dc.type.dcmi Text


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record