返回
A KRYLOV SUBSPACE METHOD FOR LARGE-SCALE SECOND-ORDER CONE LINEAR COMPLEMENTARITY PROBLEM
DOI:10.1137/140995064.png)
摘要
En 中文
In this paper, we first show that the second-order cone linear complementarity problem (SOCLCP) can be solved by finding a positive zero s* is an element of R of a particular rational function h(s), and we then propose a Krylov subspace method to reduce h(s) to h(l) (s) as in the model reduction. The zero s* of h(s) can be accurately approximated by that of h(l) (s) = 0, which itself can be cast as a small eigenvalue problem. The new method is made possible by a complete characterization of the curve of h(s), and it has several advantages over the bisection-Newton (BN) iteration recently proposed by [L.-H. Zhang and W. H. Yang, Math. Comp., 83 (2013), pp. 1701-1720] and shown to be very efficient for small-to medium-size problems. The method is tested and compared against the BN iteration and two other state-of-the-art packages: SDPT3 and SeDuMi. Our numerical results show that the method is very efficient for both small to medium dense problems and large-scale ones.
Keyword:
second-order cone
linear complementarity problem
SOCLCP
globally uniquely solvable property
GUS
Krylov subspace
model reduction
linear complementarity problem via Arnoldi process
LCPvA
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Development and Demonstration of Routing and Placement EDA Tools for Large-Scale Adiabatic Quantum-Flux-Parametron Circuits大规模绝热量子流控电路的布线与布局EDA工具的开发与验证
Insulation Studies and Experimental Results for High Tc Superconducting Power Cable高温超导电力电缆的绝缘研究及实验结果

