Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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 F = {A4, ..., A~} is a basis for R", b is a given point in R'; and it is required to find the nearest point in the simplicial cone Pos(F) to b.  develop an algorithm for solving the linear complementarity problem (q,M) or the equivalent nearest point problem [Y;b]. Computational experience in comparison with an existing algorithm is presented.
['Katta G. Murty', 'Yahya Fathi']
I am writing a research paper on a idea A critical index algorithm for nearest point problems on simplicial cones
[{"from": "human", "value": "I am writing a research paper on a idea A critical index algorithm for nearest point problems on simplicial cones"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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 F = {A4, ..., A~} is a basis for R\", b is a given point in R'; and it is required to find the nearest point in the simplicial cone Pos(F) to b.  develop an algorithm for solving the linear complementarity problem (q,M) or the equivalent nearest point problem [Y;b]. Computational experience in comparison with an existing algorithm is presented."}]