Scholarlink

<p>This paper concerns with the symmetric generalized eigenvalue complementarity problem (GEiCP) in large-scale settings. A block Lanczos method is presented in this paper to solve the symmetric GEiCP, based on the fact that a large-scale symmetric GEiCP is equivalent to its corresponding small-scale symmetric GEiCP at the event of the exact breakdown of the block Lanczos projection process. The quadratically constrained quadratic programming (QCQP) formulation is employed to solve the small-scale symmetric GEiCP for an approximate solution to the original symmetric GEiCP. The convergence analysis is presented for the case in which the block Lanczos projection process experiences no breakdown, and the convergence rate of the block Lanczos method for solving GEiCP is elaborated in detail. We compare three types of QCQP solvers based on the block Lanczos method, and numerical results demonstrate the efficiency of the block Lanczos method in solving the symmetric GEiCP.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A block Lanczos method for the symmetric generalized eigenvalue complementarity problem

  • 期刊论文

  • 发表日期：

    2025年7月22日

查看全文
  • Ziche Gong,
  • Yuan Lei,
  • Chengwen Cao,
  • Guangcai Gong

摘要

This paper concerns with the symmetric generalized eigenvalue complementarity problem (GEiCP) in large-scale settings. A block Lanczos method is presented in this paper to solve the symmetric GEiCP, based on the fact that a large-scale symmetric GEiCP is equivalent to its corresponding small-scale symmetric GEiCP at the event of the exact breakdown of the block Lanczos projection process. The quadratically constrained quadratic programming (QCQP) formulation is employed to solve the small-scale symmetric GEiCP for an approximate solution to the original symmetric GEiCP. The convergence analysis is presented for the case in which the block Lanczos projection process experiences no breakdown, and the convergence rate of the block Lanczos method for solving GEiCP is elaborated in detail. We compare three types of QCQP solvers based on the block Lanczos method, and numerical results demonstrate the efficiency of the block Lanczos method in solving the symmetric GEiCP.