Show simple item record

Higher order separation theorems and a descent algorithm for P-matrix LCPS

dc.contributor.authorMurty, Katta G.en_US
dc.date.accessioned2006-02-03T16:50:27Z
dc.date.available2006-02-03T16:50:27Z
dc.date.issued1984en_US
dc.identifierUMR4608en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/6735
dc.format.extent10 bytes
dc.format.extent13514 bytes
dc.format.extent3366 bytes
dc.format.extent15656 bytes
dc.format.extent598556 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.subjectLinear Complementarity Problem.en_US
dc.titleHigher order separation theorems and a descent algorithm for P-matrix LCPSen_US
dc.typeTechnical Reporten_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/6735/5/bam4575.0001.001.pdfen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/6735/4/bam4575.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.