Show simple item record

CP-rays in simplicial cones

dc.contributor.authorMurty, Katta G.en_US
dc.contributor.authorKelly, Leroy Miltonen_US
dc.contributor.authorWatson, Layne Terryen_US
dc.date.accessioned2006-09-11T19:33:15Z
dc.date.available2006-09-11T19:33:15Z
dc.date.issued1990-03en_US
dc.identifier.citationKelly, Leroy M.; Murty, Katta G.; Watson, Layne T.; (1990). "CP-rays in simplicial cones." Mathematical Programming 48 (1-3): 387-414. <http://hdl.handle.net/2027.42/47921>en_US
dc.identifier.issn1436-4646en_US
dc.identifier.issn0025-5610en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/47921
dc.description.abstractAn interior point of a triangle is called CP-point if its orthogonal projection on the line containing each side lies in the relative interior of that side. In classical mathematics, interest in the concept of regularity of a triangle is mainly centered on the property of every interior point of the triangle being a CP-point. We generalize the concept of regularity using this property, and extend this work to simplicial cones in ℝ n , and derive necessary and sufficient conditions for this property to hold in them. These conditions highlight the geometric properties of Z-matrices. We show that these concepts have important ramifications in algorithmic studies of the linear complementarity problem. We relate our results to other well known properties of square matrices.en_US
dc.format.extent1325371 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherSpringer-Verlag; The Mathematical Programming Society, Inc.en_US
dc.subject.otherOptimizationen_US
dc.subject.otherZ-matricesen_US
dc.subject.otherPositive Definite Matricesen_US
dc.subject.otherP-matricesen_US
dc.subject.otherLinear Complementarity Problemen_US
dc.subject.otherMathematics of Computingen_US
dc.subject.otherMathematicsen_US
dc.subject.otherCombinatoricsen_US
dc.subject.otherNumerical Analysisen_US
dc.subject.otherCalculus of Variations and Optimal Controlen_US
dc.subject.otherFacesen_US
dc.subject.otherSimplicial Conesen_US
dc.subject.otherOperation Research/Decision Theoryen_US
dc.subject.otherNumerical and Computational Methodsen_US
dc.subject.otherOrthogonal Projectionsen_US
dc.subject.otherCP-points and Raysen_US
dc.subject.otherMathematical and Computational Physicsen_US
dc.subject.otherMathematical Methods in Physicsen_US
dc.titleCP-rays in simplicial conesen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Industrial and Operations Engineering, University of Michigan, 48109-2117, Ann Arbor, MI, USAen_US
dc.contributor.affiliationotherDepartment of Mathematics, Michigan State University, 48824-1027, East Lansing, MI, USAen_US
dc.contributor.affiliationotherDepartment of Computer Science, Virginia Polytechnic Institute and State University, 24061, Blacksburg, VA, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/47921/1/10107_2005_Article_BF01582265.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01582265en_US
dc.identifier.sourceMathematical Programmingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


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.