期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
MBFGS算法中迭代矩阵的收敛性
1
作者 谢水连 《经济数学》 2006年第2期205-210,共6页
Li-Fukushima[3]提出了一种修正的BFGS方法MBFGS算法.本文研究MBFGS算法中迭代矩阵的收敛性.我们证明在一定条件下,MBFGS算法用于求解严格凸二次函数极小值时产生的迭代矩阵序列是收敛的.
关键词 无约束最优化问题 MBFGS算法 矩阵收敛性
下载PDF
大型分布式迭代随机过程的收敛性(英文)
2
作者 刘永清 邓飞其 冯昭枢 《华南理工大学学报(自然科学版)》 CSCD 1996年第5期-,共6页
研究大型分布式迭代随机过程的收敛性,利用加权和Lyapunov函数法得到了保守性较小的收敛性判据,并首次利用向量Lyapunov函数法研究大型分布式迭代随机过程的收敛性,得到了新型的收敛性判据.与相关文献比较,本文对... 研究大型分布式迭代随机过程的收敛性,利用加权和Lyapunov函数法得到了保守性较小的收敛性判据,并首次利用向量Lyapunov函数法研究大型分布式迭代随机过程的收敛性,得到了新型的收敛性判据.与相关文献比较,本文对子系统的假设是最弱的。 展开更多
关键词 分布式迭代随机过程 大系统:收敛:矩阵方程 向量Lyapunov函数
下载PDF
The σ-duals of Sequence Spaces
3
作者 李龙锁 吴雅娟 赵玟亨 《Chinese Quarterly Journal of Mathematics》 CSCD 2001年第2期30-36,共7页
In this paper, the σ_duals of two classes important sequence spaces l 1(X) and l ∞(X) are investigated, and shows that some topology properties of locally convex space (X,τ) can be characterized by the σ _dua... In this paper, the σ_duals of two classes important sequence spaces l 1(X) and l ∞(X) are investigated, and shows that some topology properties of locally convex space (X,τ) can be characterized by the σ _duals. The criterions of bounded sets in l 1(X) and l ∞(X ) with respect to the weak topologies generated by the σ _duals are obtained. Furthermore, a Schur type result and an automatic continuity theorem of matrix transformation are established. 展开更多
关键词 sequence spaces σ_duals subseries convergence
下载PDF
Convergence analysis of projected gradient descent for Schatten-p nonconvex matrix recovery 被引量:2
4
作者 CAI Yun LI Song 《Science China Mathematics》 SCIE CSCD 2015年第4期845-858,共14页
The matrix rank minimization problem arises in many engineering applications. As this problem is NP-hard, a nonconvex relaxation of matrix rank minimization, called the Schatten-p quasi-norm minimization(0 < p <... The matrix rank minimization problem arises in many engineering applications. As this problem is NP-hard, a nonconvex relaxation of matrix rank minimization, called the Schatten-p quasi-norm minimization(0 < p < 1), has been developed to approximate the rank function closely. We study the performance of projected gradient descent algorithm for solving the Schatten-p quasi-norm minimization(0 < p < 1) problem.Based on the matrix restricted isometry property(M-RIP), we give the convergence guarantee and error bound for this algorithm and show that the algorithm is robust to noise with an exponential convergence rate. 展开更多
关键词 low rank matrix recovery nonconvex matrix recovery projected gradient descent restricted isometry property
原文传递
Sequences of Lower Bounds for the Perron Root of a Nonnegative Irreducible Matrix
5
作者 钟琴 黄廷祝 《Journal of Mathematical Research and Exposition》 CSCD 2009年第4期730-736,共7页
Estimate bounds for the Perron root of a nonnegative matrix are important in theory of nonnegative matrices.It is more practical when the bounds are expressed as an easily calcu-lated function in elements of matrices.... Estimate bounds for the Perron root of a nonnegative matrix are important in theory of nonnegative matrices.It is more practical when the bounds are expressed as an easily calcu-lated function in elements of matrices.For the Perron root of nonnegative irreducible matrices,three sequences of lower bounds are presented by means of constructing shifted matrices,whose convergence is studied.The comparisons of the sequences with known ones are supplemented with a numerical example. 展开更多
关键词 nonnegative irreducible matrix shifted matrix Perron root lower bound.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部