Show simple item record

A critical index algorithm for nearest point problems on simplicial cones

dc.contributor.authorFathi, Yahyaen_US
dc.contributor.authorMurty, Katta G.en_US
dc.date.accessioned2006-09-11T19:32:29Z
dc.date.available2006-09-11T19:32:29Z
dc.date.issued1982-12en_US
dc.identifier.citationMurty, Katta G.; Fathi, Yahya; (1982). "A critical index algorithm for nearest point problems on simplicial cones." Mathematical Programming 23(1): 206-215. <http://hdl.handle.net/2027.42/47910>en_US
dc.identifier.issn0025-5610en_US
dc.identifier.issn1436-4646en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/47910
dc.description.abstractWe consider the linear complementarity problem ( q, M ) in which M is a positive definite symmetric matrix of order n. This problem is equivalent to a nearest point problem [ Γ; b ] in which Γ = { A . 1 , ⋯, A. n } is a basis for R n , b is a given point in R n ; and it is required to find the nearest point in the simplicial cone Pos( Γ ) to b. We develop an algorithm for solving the linear complementarity problem ( q, M ) or the equivalent nearest point problem [ Γ; b ]. Computational experience in comparison with an existing algorithm is presented.en_US
dc.format.extent452206 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.otherMathematical and Computational Physicsen_US
dc.subject.otherCritical Indexen_US
dc.subject.otherDimension Reductionen_US
dc.subject.otherNumerical and Computational Methodsen_US
dc.subject.otherLinear Complementarity Problemen_US
dc.subject.otherOperation Research/Decision Theoryen_US
dc.subject.otherMathematical Methods in Physicsen_US
dc.subject.otherNearest Pointen_US
dc.subject.otherSimplicial Coneen_US
dc.subject.otherOrthogonal Projectionen_US
dc.subject.otherOptimizationen_US
dc.subject.otherCombinatoricsen_US
dc.subject.otherCalculus of Variations and Optimal Controlen_US
dc.subject.otherMathematicsen_US
dc.subject.otherMathematics of Computingen_US
dc.subject.otherNumerical Analysisen_US
dc.titleA critical index algorithm for nearest point problems on 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, 48019, Ann Arbor, MI, USAen_US
dc.contributor.affiliationotherSchool of Industrial and Systems Engineering, Georgia Institute of Technology, 30332, Atlanta, GA, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/47910/1/10107_2005_Article_BF01583789.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01583789en_US
dc.identifier.sourceMathematical Programmingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

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.