Show simple item record

Nearest points in nonsimplicial cones and LCP's with PSD symmetric matrices

dc.contributor.authorAl-Sultan, Khaled S.en_US
dc.contributor.authorMurty, Katta G.en_US
dc.date.accessioned2006-02-03
dc.date.available2006-02-03
dc.date.issued1998en_US
dc.identifierUMR4464en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/3256
dc.format.extent15 bytes
dc.format.extent23694 bytes
dc.format.extent3366 bytes
dc.format.extent26913 bytes
dc.format.extent1056974 bytes
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.subjectEngineering, Industrial.en_US
dc.subjectLinear complimentarity problem.en_US
dc.subjectMatrices.en_US
dc.subjectProgramming (Mathematics)en_US
dc.subjectVector algebra.en_US
dc.subjectAlgorithms.en_US
dc.titleNearest points in nonsimplicial cones and LCP's with PSD symmetric matricesen_US
dc.typeTechnical Reporten_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/3256/5/bal7870.0001.001.pdfen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/3256/4/bal7870.0001.001.txten_US
dc.owningcollnameEngineering, College of - Technical Reports


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.