# A critical index algorithm for nearest point problems on simplicial cones

@article{Murty1982ACI, title={A critical index algorithm for nearest point problems on simplicial cones}, author={Katta G. Murty and Yahya Fathi}, journal={Mathematical Programming}, year={1982}, volume={23}, pages={206-215} }

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… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 16 CITATIONS

## An active index algorithm for the nearest point problem in a polyhedral cone

VIEW 12 EXCERPTS

CITES BACKGROUND, METHODS & RESULTS

## A RECURSIVE ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN AN UNBOUNDED POLYHEDRON

VIEW 1 EXCERPT

CITES BACKGROUND

## A New Practically Efficient Interior Point Method for LP

VIEW 1 EXCERPT

CITES METHODS

## Quadratic Programming in Geometric Optimization: Theory, Implementation, and Applications

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-7 OF 7 REFERENCES

## Linear and combinatorial programming : K.G. Murty: 1976,J. Wiley, New York, 310 pp

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Methods for modifying matrix factorizations.

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## On the linear complementarity problem

VIEW 1 EXCERPT

## Faddeeva, Computational methods of linear algebra (Freeman

VIEW 3 EXCERPTS