求解非对称鞍点系统的不精确增广拉格朗日算法
An inexact augmented Lagrangian algorithm for unsymmetric saddle-point systems
AI总结:
本文提出一种求解非对称鞍点系统的不精确增广拉格朗日算法(SPALBB),利用Barzilai-Borwein方法求解线性系统,证明了其收敛性,并在Navier-Stokes等数值实验中展现出优于BICGSTAB和GMRES的鲁棒性与效率。
摘要:
增广拉格朗日(AL)方法是求解约束优化问题的一类著名算法。它们已被扩展用于求解线性方程组的鞍点系统。我们研究了一种用于非对称鞍点系统的AL(SPAL)算法,并推导了其收敛和半收敛性质,即使系统是奇异的也成立。在每一步中,我们的SPAL需要精确求解一个相同规模但具有SPD (2,2)块的线性系统。为了提高效率,我们引入了一种不精确的SPAL算法。我们在合理的假设下建立了其收敛性质。具体而言,我们使用一种称为Barzilai-Borwein(BB)方法的梯度方法来求解每次迭代的线性系统。我们将结果称为增广拉格朗日BB(SPALBB)算法,并研究了其收敛性。在来自Navier-Stokes方程和耦合Stokes-Darcy流的测试问题上的数值实验表明,SPALBB比BICGSTAB和GMRES更鲁棒且更高效。SPALBB通常需要最少的CPU时间,尤其是在大型系统上。
英文摘要:
Augmented Lagrangian (AL) methods are a well known class of algorithms for solving constrained optimization problems. They have been extended to the solution of saddle-point systems of linear equations. We study an AL (SPAL) algorithm for unsymmetric saddle-point systems and derive convergence and semi-convergence properties, even when the system is singular. At each step, our SPAL requires the exact solution of a linear system of the same size but with an SPD (2,2) block. To improve efficiency, we introduce an inexact SPAL algorithm. We establish its convergence properties under reasonable assumptions. Specifically, we use a gradient method, known as the Barzilai-Borwein (BB) method, to solve the linear system at each iteration. We call the result the augmented Lagrangian BB (SPALBB) algorithm and study its convergence. Numerical experiments on test problems from Navier-Stokes equations and coupled Stokes-Darcy flow show that SPALBB is more robust and efficient than BICGSTAB and GMRES. SPALBB often requires the least CPU time, especially on large systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。