arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.01709math.OC
收藏

秩约束仿射矩阵集的误差界研究

On Error Bounds for Rank-Constrained Affine Matrix Sets

Tsinghua University(清华大学);The Hong Kong Polytechnic University(香港理工大学)

Ruoning Chen, Defeng Sun, Liping Zhang

AI总结:

针对秩约束矩阵问题迭代算法收敛分析依赖的局部误差界指数不明确的问题,本文推导了秩约束仿射可行集带显式维度相关指数的赫尔德型局部误差界,为数值方法收敛分析提供几何定量基础。

摘要:

秩约束矩阵问题在科学与工程领域频繁出现。针对这类问题开发的迭代算法的收敛性分析通常依赖局部误差界,该误差界将到可行集的距离与约束违反程度的度量关联起来。半代数几何中的基础结论保证了这类误差界的存在性,但其相关指数通常无法被显式确定。本文针对典型的秩约束仿射可行集,建立了一个带有显式指数的局部Hölderian(赫尔德型)误差界。本文证明,在任意紧集上,到可行集的距离可由一个自然残差函数的幂次界定,该残差函数同时刻画了秩约束与仿射约束的违反情况。误差界中的指数由问题的维度显式给出。这一结果为解集的几何性质提供了基础定量结论,为一大类数值方法的收敛性分析铺平了道路。

英文摘要:

Rank-constrained matrix problems appear frequently across science and engineering. The convergence analysis of iterative algorithms developed for these problems often hinges on local error bounds, which correlate the distance to the feasible set with a measure of how much the constraints are violated. Foundational results in semi-algebraic geometry guarantee that such bounds exist, yet the associated exponents are generally not explicitly determined. This paper establishes a local Hölderian error bound with an explicit exponent for the canonical rank-constrained affine feasibility set. This paper proves that, on any compact set, the distance to the feasible set is bounded by a power of a natural residual function capturing violations in both the rank and affine constraints. The exponent in this bound is given explicitly in terms of the problem's dimensions. This provides a fundamental quantitative result on the geometry of the solution set, paving the way for the convergence analysis of a broad class of numerical methods.

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

↑