Abstract
We consider the linear complementarity problem (q, M) in whichM is a positive definite symmetric matrix of ordern. This problem is equivalent to a nearest point problem [Γ; b] in whichΓ = {A.1,⋯, A. n } is a basis for Rn,b is a given point in Rn; and it is required to find the nearest point in the simplicial cone Pos(Γ) tob. 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.
Similar content being viewed by others
References
D.K. Faddev and V.N. Faddeeva,Computational methods of linear algebra (Freeman, San Francisco, CA, 1963).
P.E. Gill, G.H. Golub, W. Murray and M.A. Saunders, “Methods for modifying matrix factorizations”,Mathematics of Computation 28 (1974) 505–535.
K.G. Murty,Linear and combinatorial programming (Wiley, New York, 1976).
K.G. Murty, “On the number of solutions to the complementarity problem and spanning properties of complementary cones”,Linear Algebra and Its Applications 5 (1972) 65–108.
K.G. Murty, “On the linear complementarity problem”,Operations Research Verfahren 31 (1978) 425–439.
D.R. Wilhelmsen, “A nearest point algorithm for convex polyhedral cones and applications to positive linear approximation”,Mathematics of Computation 30 (1976) 48–57.
P. Wolfe, “Finding the nearest point in a polytope”,Mathematical Programming 11 (1976) 128–149.
Author information
Authors and Affiliations
Additional information
Research effort partially supported by the Air Force Office of Scientific Research. Air Force Systems Command, USAF, under grant No. AFOSR 78-3646. The United States Government is authorized to reproduce and distribute reprints for governmental purposes, not withstanding any copyright notation hereon.
Rights and permissions
About this article
Cite this article
Murty, K.G., Fathi, Y. A critical index algorithm for nearest point problems on simplicial cones. Mathematical Programming 23, 206–215 (1982). https://doi.org/10.1007/BF01583789
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01583789