PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we first propose three practical algorithms for linear complementarity problems, which are based on the polynomial time method of Kojima, Mizuno and Yoshise [5] , and compare them by showing the computational complexities. Then we modify two of the algorithms in order to accelerate them. Through the computational experiments for three types of linear complementarity problems, we compare the proposed algorithms in practice and see the efficiency of the modified algorithms. We also estimate the practical computational complexity of each algorithm for each type of problems.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Mizuno S
Tokyo Inst. Technology
-
Mizuno Shinji
Department Of Radiology Gifu University School Of Medicine
-
Yoshise Akiko
Tokyo Institute Of Technology
-
KURABAYASHI Teruyo
Institute of Applied Biochemistry, University of Tsukuba
-
Kikuchi Takeshi
Yamaha Co., Ltd.
-
Kikuchi T
Ibaraki Univ. Ibaraki‐ken Jpn
-
Mizuno Shinji
Department Of Industial Engineering And Management Tokyo Institute Of Technology
関連論文
- Detection of cerebrospinal fluid leakage in intracranial hypotension with radionuclide cisternography and blood activity monitoring
- M Pathway and Areas 44 and 45 Are Involved in Stereoscopic Recognition Based on Binocular Disparity
- Glucose metabolism evaluated by positron emission tomography in Lafora disease
- A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
- Characteristics of Escherichia coli HB101 and Pseudomonas putida PpY101 Harboring a Recombinant Plasmid with Tandem Insertion of the Mercury Resistance Operon
- Transformation of Pseudomonas putida by Electroporation
- MR imaging and ^1H-MR spectroscopy in a case of juvenile Alexander disease
- PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
- A convex property of monotone complementarity problems.
- AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM