Computing Distances Between Convex Sets and Subsets of the Positive Semidefinite Matrices

Simple item page
dc.contributor.authorTrosset, Michaelen_US
dc.date.accessioned2018-06-18T17:44:06Zen_US
dc.date.available2018-06-18T17:44:06Zen_US
dc.date.issued1997-03en_US
dc.date.noteMarch 1997en_US
dc.description.abstractWe describe an important class of semidefinite programming problems that has received scant attention in the optimization community. These problems are derived from considerations in distance geometry and multidimensional scaling and therefore arise in a variety of disciplines, e.g. computational chemistry and psychometrics. In most applications, the feasible positive semidefinite matrices are restricted in rank, so that recent interior-point methods for semidefinite programming do not apply. We establish some theory for these problems and discuss what remains to be accomplished.en_US
dc.format.extent16 ppen_US
dc.identifier.citationTrosset, Michael. "Computing Distances Between Convex Sets and Subsets of the Positive Semidefinite Matrices." (1997) <a href="https://hdl.handle.net/1911/101889">https://hdl.handle.net/1911/101889</a>.en_US
dc.identifier.digitalTR97-03en_US
dc.identifier.urihttps://hdl.handle.net/1911/101889en_US
dc.language.isoengen_US
dc.titleComputing Distances Between Convex Sets and Subsets of the Positive Semidefinite Matricesen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR97-03.pdf
Size:
193.85 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports