作者: Todd Munson , Michael C. Ferris , Qian Li
DOI:
关键词: Key (cryptography) 、 Scheme (programming language) 、 Solver 、 Component (UML) 、 Mathematics 、 Reliability (computer networking) 、 Path (graph theory) 、 Mathematical optimization 、 Linear algebra 、 Linear system
摘要: This research aims enhancing the efficiency and reliability of PATH, most widely used solver for mixed complementarity problems. A key component PATH algorithm is solving a series linear complementary subproblems with pivotal scheme. Improving system routines (factor, solve, update) required by method critical computational issue. We incorporate two new options besides default LUSOL package in such functionalities. One employs UMFPACK factor solve operations, together an implementation stable efficient block-LU updating scheme, which l eads to significantly more effective version many large-scale sparse systems. The other option exploits COIN-OR utilities enhanced adapting refinements scaling schemes COIN-LP routines, smaller-scale systems but less competitive on cases.