CP-rays in simplicial cones
dc.contributor.author | Murty, Katta G. | en_US |
dc.contributor.author | Kelly, Leroy Milton | en_US |
dc.contributor.author | Watson, Layne Terry | en_US |
dc.date.accessioned | 2006-09-11T19:33:15Z | |
dc.date.available | 2006-09-11T19:33:15Z | |
dc.date.issued | 1990-03 | en_US |
dc.identifier.citation | Kelly, 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.issn | 1436-4646 | en_US |
dc.identifier.issn | 0025-5610 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/47921 | |
dc.description.abstract | An 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.extent | 1325371 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag; The Mathematical Programming Society, Inc. | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Z-matrices | en_US |
dc.subject.other | Positive Definite Matrices | en_US |
dc.subject.other | P-matrices | en_US |
dc.subject.other | Linear Complementarity Problem | en_US |
dc.subject.other | Mathematics of Computing | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Numerical Analysis | en_US |
dc.subject.other | Calculus of Variations and Optimal Control | en_US |
dc.subject.other | Faces | en_US |
dc.subject.other | Simplicial Cones | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Numerical and Computational Methods | en_US |
dc.subject.other | Orthogonal Projections | en_US |
dc.subject.other | CP-points and Rays | en_US |
dc.subject.other | Mathematical and Computational Physics | en_US |
dc.subject.other | Mathematical Methods in Physics | en_US |
dc.title | CP-rays in simplicial cones | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, University of Michigan, 48109-2117, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | Department of Mathematics, Michigan State University, 48824-1027, East Lansing, MI, USA | en_US |
dc.contributor.affiliationother | Department of Computer Science, Virginia Polytechnic Institute and State University, 24061, Blacksburg, VA, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/47921/1/10107_2005_Article_BF01582265.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01582265 | en_US |
dc.identifier.source | Mathematical Programming | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
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.