A mean value algorithm for Toeplitz matrix completion

In this paper, we propose a new mean value algorithm for the Toeplitz matrix completion based on the singular value thresholding (SVT) algorithm. The completion matrices generated by the new algorithm keep a feasible Toeplitz structure. Meanwhile, we prove the convergence of the new algorithm under some reasonal conditions. Finally, we show the new algorithm is much more effective than the ALM (augmented Lagrange multiplier) algorithm through numerical experiments and image inpainting.     

ON SOME RESULTS ABOUT INEXACT LINEAR PROGRAMMING

I intreductiouInexact programs have been introduced by Soyster L4), and most of the results are givenby Soyster L6J-- LS], Falk [fi and Promerol L4J. The optimization problem described bySoyster is as follows:where the binds operation "+" refers the addition of sets. K, are non--empty convex sets,and K(b) ~ {ye r 1 y相似文献   

完全Rees矩阵半群的分解及性质

用等价关系Q^~出了完全Rees矩阵半群的一种分解．而且得到了它的每个Q^~一类的表示．     

Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces

We develop an inexact proximal point algorithm for solving equilibrium problems in Banach spaces which consists of two principal steps and admits an interesting geometric interpretation. At a certain iterate, first we solve an inexact regularized equilibrium problem with a flexible error criterion to obtain an axillary point. Using this axillary point and the inexact solution of the previous iterate, we construct two appropriate hyperplanes which separate the current iterate from the solution set of the given problem. Then the next iterate is defined as the Bregman projection of the initial point onto the intersection of two halfspaces obtained from the two constructed hyperplanes containing the solution set of the original problem. Assuming standard hypotheses, we present a convergence analysis for our algorithm, establishing that the generated sequence strongly and globally converges to a solution of the problem which is the closest one to the starting point of the algorithm.     

约束线性模型异常值检验

本文讨论了带约束线性模型的数据删除模型和均值漂移模型，得到了带约束情况下上述两个模型的统计量之间的关系，建立了相应的异常值检验统计量及性质。     

基于均值的Toeplitz矩阵填充的子空间算法

本文提出一种基于均值的Toeplitz矩阵填充的子空间算法.通过在左奇异向量空间中对已知元素的最小二乘逼近,形成了新的可行矩阵;并利用对角线上的均值化使得迭代后的矩阵保持Toeplitz结构,从而减少了奇异向量空间的分解时间.理论上,证明了在一定条件下该算法收敛于一个低秩的Toeplitz矩阵.通过不同已知率的矩阵填充数值实验展示了Toeplitz矩阵填充的新算法比阈值增广Lagrange乘子算法在时间上和精度上更有效.     

On the convergence of inexact block coordinate descent methods for constrained optimization

We consider the problem of minimizing a smooth function over a feasible set defined as the Cartesian product of convex compact sets. We assume that the dimension of each factor set is huge, so we are interested in studying inexact block coordinate descent methods (possibly combined with column generation strategies). We define a general decomposition framework where different line search based methods can be embedded, and we state global convergence results. Specific decomposition methods based on gradient projection and Frank–Wolfe algorithms are derived from the proposed framework. The numerical results of computational experiments performed on network assignment problems are reported.     

关于极大强单调算子的不精确邻近点算法的收敛性分析

该文研究集值映象方程0∈T(z)的解的迭代逼近,其中T是极大强单调算子．设{x^k}与{e^k}是由不精确邻近点算法x^{k+1}+c_kT(x^{k+1})> x^k+e^{k+1}生成的序列,满足‖e^{k+1}‖≤η_k‖x^{k+1}_x^k‖, ∑^∞_{k=0}(η_k-1)<+∞且inf_(k≥0) η_k=μ≥1.在适当的限制下证明了,{x^k}收敛到T的一个根当且仅当lim inf_{k→+∞} d(x^k,Z)=0,其中Z是方程0∈T(z)的解集     

ON HERMITIAN AND SKEW-HERMITIAN SPLITTING ITERATION METHODS FOR CONTINUOUS SYLVESTER EQUATIONS

We present a Hermitian and skew-Hermitian splitting (HSS) iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semi-definite matrices. The unconditional convergence of the HSS iteration method is proved and an upper bound on the convergence rate is derived. Moreover, to reduce the computing cost, we establish an inexact variant of the HSS iteration method and analyze its convergence property in detail. Numerical results show that the HSS iteration method and its inexact variant are efficient and robust solvers for this class of continuous Sylvester equations.     

矩阵方程X＋AXB＝C与线性流形上的矩阵最佳逼近

该文给出了矩阵方程Ｘ＋ＡＸＢ＝Ｃ存在唯一解的充分必要条件和解的表达式,该公式只是Ａ,Ｂ,Ｃ的多项式,利用该结果,解决了Ａ１ＸＢ１－Ｃ的解的表达式问题．     

无约束优化的一类共轭梯度法(英)

本文给出了一类具有4个参数的共轭梯度法，并且分析了其中两个子类的方法．证明了在步长满足更一般的Wolfe条件时，这两个子类的方法是下降算法．同时还证明了这两个子类算法的全局收敛性．     

线性方程组的一种解法

本文利用矩阵的分块运算法则，给出求线性方程组ＡｍｎＸｎ＝Ｏｍ及ＡｍｎＸｎ＝ｂｍ一种方法．