返回
A preconditioner for linear systems arising from interior point optimization methods
DOI:10.1137/060661673.png)
摘要
En 中文
We explore a preconditioning technique applied to the problem of solving linear systems arising from primal-dual interior point algorithms in linear and quadratic programming. The preconditioner has the attractive property of improved eigenvalue clustering with increased ill-conditioning of the ( 1,1) block of the saddle point matrix. It fits well into the optimization framework since the interior point iterates yield increasingly ill-conditioned linear systems as the solution is approached. We analyze the spectral characteristics of the preconditioner, utilizing projections onto the null space of the constraint matrix, and demonstrate performance on problems from the NETLIB and CUTEr test suites. The numerical experiments include results based on inexact inner iterations.
Keyword:
block preconditioners
saddle point systems
primal-dual interior point methods
augmentation
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
Theory of inexact Krylov subspace methods and applications to scientific computing不精确Krylov子空间方法的理论及其在科学计算中的应用
Postoperative Radiotherapy for Completely Resected Masaoka/Masaoka-Koga Stage II/III Thymoma Improves Overall Survival: An Updated Meta-Analysis of 4746 Patients完全切除的Masaoka/Masaoka-Koga分期II/III期胸腺瘤术后放疗可改善总生存率:一项包含4746例患者的更新Meta分析

