Answers are grounded in this paper and cite their sources.
In this paper, a full-Newton step interior-point algorithm is proposed for solving P*κ-linear complementarity problem based on a new search direction, which is an extension of Grimes' algorithm. It is proved that the number of iterations of the algorithm is On1+4κlognε, which matches the best known iteration bound of the interior-point method for P*κ-linear complementarity problem. Some numerical results have proved the feasibility and efficiency of the proposed algorithm.
No takes yet. Share an insight, caveat, or question.
A 2025 study studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: