arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.19792math.NAcs.NA
收藏

双鞍点问题的部分条件数

Partial Condition Numbers for Double Saddle Point Problems

Sk. Safique Ahmad, Pinki Khatun

AI总结:

本文建立双鞍点问题部分条件数的统一框架,给出范数型、混合型和分量型条件数及其尖锐上界,并推广至结构化情形与EILS问题。

摘要:

本文提出了一个统一框架,用于研究双鞍点问题(DSPPs)解的部分条件数(CN),并给出了其闭式表达式。该统一框架将众所周知的部分范数型条件数(NCN)、部分混合型条件数(MCN)和部分分量型条件数(CCN)作为特例包含在内。此外,我们推导了部分NCN、MCN和CCN的尖锐上界,这些上界计算高效,且无需使用昂贵的Kronecker积。通过施加保持DSPPs分块矩阵结构的扰动,我们分析了当分块矩阵具有线性结构时的结构化部分NCN、MCN和CCN。利用DSPP与等式约束不定最小二乘(EILS)问题之间的关系,我们恢复了EILS问题的部分CNs。数值结果证实了所推导上界的尖锐性,并展示了它们在估计部分CNs方面的有效性。

英文摘要:

This paper presents a unified framework for investigating the partial condition number (CN) of the solution of double saddle point problems (DSPPs) and provides closed-form expressions for it. This unified framework encompasses the well-known partial normwise CN (NCN), partial mixed CN (MCN) and partial componentwise CN (CCN) as special cases. Furthermore, we derive sharp upper bounds for the partial NCN, MCN and CCN, which are computationally efficient and free of expensive Kronecker products. By applying perturbations that preserve the structure of the block matrices of the DSPPs, we analyze the structured partial NCN, MCN and CCN when the block matrices exhibit linear structures. By leveraging the relationship between DSPP and equality constrained indefinite least squares (EILS) problems, we recover the partial CNs for the EILS problem. Numerical results confirm the sharpness of the derived upper bounds and demonstrate their effectiveness in estimating the partial CNs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑