一类离散型奇异积分算子

设｛αｋ｝∞ｋ＝－∞为正数缺项序列，满足ｉｎｆｋαｋ＋１／ｄｋ＝α＞１，Ω（ｙ′）为Ｂｅｓｏｖ空间Ｂ０，１１（Ｓｎ－１）上的函数，其中Ｓｎ－１为Ｒｎ（ｎ２）上的单位球面．本文证明：若∫Ｓｎ－１Ω（ｙ′）ｄσ（ｙ′）＝０，则离散型奇异积分ＴΩ（ｆ）（ｘ）＝∑∞ｋ＝－∞∫Ｓｎ－１ｆ（ｘ－αｋｙ′）Ω（ｙ′）ｄσ（ｙ′）和相关的极大算子ＴΩ（ｆ）（ｘ）＝ｓｕｐＮ∑∞ｋ＝Ｎ∫Ｓｎ－１ｆ（ｘ－αｋｙ′）Ω（ｙ′）ｄσ（ｙ′）均在Ｌ２（Ｒｎ）上有界．上述结果推广了Ｄｕｏａｎｄｉｋｏｅｔｘｅａ和ＲｕｂｉｏｄｅＦｒａｎｃｉａ［１］在Ｌ２情形下的一个结果     

Riccati微分方程的可积条件

Ｉｎ１９９８,ＺｈａｏＬｉｎｌｏｎｇ［１］ｏｂｔａｉｎｅｄｔｈｅｉｎｔｅｇｒａｂｌｅｃｏｎｄｉｔｉｏｎ：Ｒ＝１αγＰｅ２∫（Ｑ－βＤ）ｄｘ　　　（α,β,γｉｓｃｏｎｓｔ）．（１）ＦｏｒＲｉｃｃａｔｉｅｑｕａｔｉｏｎ：ｙ′＝ｐ（ｘ）ｙ２＋Ｑ（ｘ）ｙ＋Ｒ（ｘ）　　（ＰＲ≠０）．（２）　　Ｈｅｒｅｔｈｅｎｅｗｉｎｔｅｇｒａｂｌｅｃｏｎｄｉｔｉｏｎｓｉｓｇｉｖｅｎ：Ｌ［ｙ０］＝１αγＰｅ２∫（Ｑ＋２ｙ０ｐ－βＤ）ｄｘ．（３）Ｌ［ＡＢ＋ｙ０］＝１αγ（ＡＢ）２Ｌ［ｙ０］ｅ２∫（２ＢＡＬ［ｙ０］＋Ｑ＋２ｙ…     

改进HS共轭梯度算法及其全局收敛性

１．引 言 １９５２年 Ｍ．Ｈｅｓｔｅｎｅｓ和Ｅ．Ｓｔｉｅｆｅｌ提出了求解正定线性方程组的共轭梯度法［１］．１９６４年Ｒ．Ｆｌｅｔｃｈｅｒ和Ｃ．Ｒｅｅｖｅｓ将该方法推广到求解下列无约束优化问题： ｍｉｎｆ（ｘ）,ｘ∈Ｒｎ,（１）其中ｆ：Ｒｎ→Ｒ１为连续可微函数,记ｇｋ＝ ｆ（ｘｋ）,ｘｋ∈ Ｒｎ． 若点列｛ｘｋ｝由如下算法产生：其中 βｋ＝［ｇＴｋ（ｇｋ－ｇｋ－１）］／［ｄＴｋ－１（ｇｋ－ｇｋ－１）］．（Ｈｅｓｔｅｎｅｓ－Ｓｔｉｅｆｅｌ）　　（４）则称该算法为 Ｈｅｓｔｅｎｅｓ—Ｓｔｉｅｆｅｌ共轭梯度算…     

Boundedness of the Maximal Operator on Lipα（R^n）（0〈α〈1）

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＡｌｏｃａｌｌｙｉｎｔｅｇｒａｂｌｅｆｕｎｃｔｉｏｎｆ（ｘ）ｂｅｌｏｎｇｓｔｏＬｉｐα（Ｒｎ）,ｉｆｔｈｅｒｅｉｓａｃｏｎｓｔａｎｔＣ,ｓｕｃｈｔｈａｔｆｏｒｅｖｅｒｙｘ,ｙ∈Ｒｎ｜ｆ（ｘ）－ｆ（ｙ）｜≤Ｃ｜ｘ－ｙ｜α　　ＴｈｅｓｍａｌｌｅｓｔｃｏｎｓｔａｎｔＣｓａｔｉｓｆｉｅｓａｂｏｖｅｉｓｃａｌｌｅｄＬｉｐｓｃｈｉｔｚｎｏｒｍｏｆｆａｎｄｉｓｄｅｎｏｔｅｄｂｙｙｆｙ∧α．Ｂｙ［１］,ｆ∈Ｌｉｐα（Ｒｎ）ｅｑｕｉｖａｌｅｎｔｔｏｆ∈εα,２,ｗｈｅｒｅεα,２＝…     

Goldstein, Levitin-Polyak投影法中的一个可行步长准则

１引　言设Ω是Ｒｎ空间的一个非空的凸闭紧子集,Ｆ是Ｒｎ→Ｒｎ的算子．我们考虑变分不等式问题： 变分不等式问题在数学规划中起着很重要的作用,因此,长期以来一直受到广泛的重视．求解变分不等式问题的方法中,有一类投影迭代方法,例如［１,４,６,９］．在所有的投影迭代方法中,Ｇｏｌｄｓｔｅｉｎ［６］,Ｌｅｖｉｔｉｎ－Ｐｏｌｙａｋ［９］所提出的方法;是最简单的．这里,ＰΩ（ｘ）是ｘ在　上的投影,即　的唯一解． 我们称算子Ｆ在集合Ω上是单调的,若在用Ｇｏｌｄｓｔｅｉｎ,Ｌｅｖｉｔｉｎ－Ｐｏｌｙａｋ方法（２）求…     

ON THE NON-EXISTENCE OF LIMIT CYCLES OF CERTAIN QUADRATIC SYSTEMS

§１．Ｆｏｒｔｈｅｓｙｓｔｅｍｘ＝－ｙ＋δｘ＋ｌｘ２＋ｎｙ２＝Ｐ（ｘ，ｙ），ｙ＝ｘ（１＋ａｘ－ｙ）＝Ｑ（ｘ，ｙ），｛（１．１）ｗｅｃａｎｆｉｎｄｉｎ［１］ｔｈｅｆｏｌｏｗｉｎｇ：ＣｏｎｊｅｃｔｕｒｅＩ．Ａｓｓｕｍｅ１ａ＜０，ｎ＞１，ｎ＋ｌ＞０，ｎａ２...     

求解不等式约束最优化问题的MBF—ODE方法

１引言考虑用基于修正内罚函数的常微分方程（ＭＢＦ－ＯＤＥ）方法求解下列不等式约束极小化问题：其中ｆi∈ｃ２：Ｒ,ｉ=0,１,…,ｍ．求解无约束极小化问题的ＯＤＥ的一般形式是其中,φ（ｘ）∈Ｃ１：ΩＲｎ→Ｒ;ｓ（ｘ）∈Ｃ１：ΩＲｎ→Ｒｎ且满足φ（ｘ）＞０,ｓＴ（ｘ）ｆ（ｘ）＜０,ｆ（ｘ）∈Ｃ１：Ｒｎ→Ｒ为目标函数．为便于用ＯＤＥ方法求解（１．ｌ）,可藉助于罚函数将（１．ｌ）变换为无约束极小化问题（见［７］．但由于经典罚函数（ＣＢＦ）在计算上有较大的困难,我们采用修正内罚函数（ＭＢＦ）．其基本思想是用…     

有理样条不可约解的行列式表示

１引言在文［１］中,对于剖分ａ＝ｘ０＜ｘ１＜…＜ｍｎ＝ｂ及给定的ｙ０,ｙ１,…,　…,Ｌ＋Ｍ－１,我们构造了有理样条Ｓ［Ｌ,Ｍ（ｘ）Ｑ［Ｌ,Ｍ］为次数不超过ｍ的多项式全体．在［１］中,已经讨论了Ｓ［Ｌ,Ｍ］（ｘ）的存在性,并指出：若问题（１）（２）（３）可解,则解唯一这里总假设问题（１）（２）（３）可解．２有理样条解不可约的充要条件由Ｓ［Ｌ,Ｍ］（ｘ）的依区间递推算法（见［１］）,我们只需讨论［ｘ０,ｘ１］上的情形．当［Ｘ０,ｘ１］时,将Ｓ［Ｌ,Ｍ］　（ｘ）,Ｐ［Ｌ,Ｍ］　（ｘ）和Ｑ［Ｌ,Ｍ］（…     

一类序保持系统解的收敛性

本文研究微分方程组ｘｉ＝Ｆｉ（ｘ１，…ｘｎ）（ｘ∈Ｒｎ＋）解的收敛性．如果该系统满足下列条件：（ｉ）Ｆ（Ｏ）Ｏ；（ｉ）Ｆｉ（ｘ１，…ｘｎ）关于ｘｋ是单调增的（ｋ≠ｉ）；（ｉｉ）Ｆ（ｘ＊ｇ（ｓ））ｈ（ｓ）＊Ｆ（ｘ）（０ｓ１），这里ｘ＊ｙ＝（ｘ１ｙ１，…ｘｎｙｎ），ｇ，ｈ：［０，１］→［０，１］ｎ满足ｇｉ（０）＝ｈｉ（０）＝Ｏ，ｇｉ（１）＝ｈｉ（１）＝１，Ｏ＜ｇｉ（ｓ），ｈｉ（ｓ）＜１，ｓ∈（０，１）；（ｉｖ）系统的每个解在Ｒｎ＋中有界，则每个解收敛于奇点．本文还把这一结果推广到离散的序保持动力系统．     

由FR共轭梯度法控制的两类优化算法的全局收敛性

１引言 考虑无约束优化问题其中ｆ：Ｒｎ→Ｒ是一阶可微函数．求解（１）的非线性共轭梯度法具有如下形式：其中ｇｋ＝　ｆ（ｘｋ）,ａｋ是通过某种线搜索获得的步长,纯量βｋ的选取使得方法（２）—（３）在ｆ（ｘ）是严格凸二次函数且采用精确线搜索时化为线性共轭梯度法［１］．比较常见的βｋ的取法有Ｆｌｅｔｃｈｅｒ－Ｒｅｅｖｅｓ（ＦＲ）公式［２］和Ｐｏｌａｋ－Ｒｉｂｉｅｒｅ－Ｐｏｌｙａｋ（ＰＲＰ）公式［３－４］等．它们分别为其中　　　取欧几里得范数．对于一般非线性函数,ＦＲ方法具有较好的理论收敛性［５－６］,而…     

The Incremental Gauss-Newton Algorithm with Adaptive Stepsize Rule

In this paper, we consider the Extended Kalman Filter (EKF) for solving nonlinear least squares problems. EKF is an incremental iterative method based on Gauss-Newton method that has nice convergence properties. Although EKF has the global convergence property under some conditions, the convergence rate is only sublinear under the same conditions. One of the reasons why EKF shows slow convergence is the lack of explicit stepsize. In the paper, we propose a stepsize rule for EKF and establish global convergence of the algorithm under the boundedness of the generated sequence and appropriate assumptions on the objective function. A notable feature of the stepsize rule is that the stepsize is kept greater than or equal to 1 at each iteration, and increases at a linear rate of k under an additional condition. Therefore, we can expect that the proposed method converges faster than the original EKF. We report some numerical results, which demonstrate that the proposed method is promising.     

Stepsize analysis for descent methods

The convergence rates of descent methods with different stepsize rules are compared. Among the stepsize rules considered are: constant stepsize, exact minimization along a line, Goldstein-Armijo rules, and stepsize equal to that which yields the minimum of certain interpolatory polynomials. One of the major results shown is that the rate of convergence of descent methods with the Goldstein-Armijo stepsize rules can be made as close as desired to the rate of convergence of methods that require exact minimization along a line. Also, a descent algorithm that combines a Goldstein-Armijo stepsize rule with a secant-type step is presented. It is shown that this algorithm has a convergence rate equal to the convergence of descent methods that require exact minimization along a line and that, eventually (i.e., near the minimum), it does not require a search to determine an acceptable stepsize.     

新非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法

本文设计了求解无约束最优化问题的新的非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法.新的步长规则类似于Grippo非单调线搜索规则并包含Grippo非单调线搜索规则作为特例.新的步长规则在每一次线搜索时得到一个相对于Grippo非单调线搜索规则的较大步长,同时保证算法的全局收敛性.数值例子表明算法是有效的,适合求解大规模问题.     

无约束最优化线搜索一般模型及BFGS方法的整体收敛性

本文给出了无约束最优化的算法中线性搜索的可接受的步长选择律的一种一般形式，它概括了大多数已有的步长律为其特例，并且研究了它基本性质，最后证明了此线性搜索一般模拟相结合的无约束优化的ＢＦＧＳ算法的整体收敛性。     

在一个新步长规则下梯度投影算法的全局收敛性

考虑约束最优化问题：minx∈Ωf(x)其中:f:R^n→R是连续可微函数，Ω是一闭凸集。本文研究了解决此问题的梯度投影方法，在步长的选取时采用了一种新的策略，在较弱的条件下，证明了梯度投影响方法的全局收敛性。     

A NOTE ON THE GRADIENT PROJECTION METHOD WITH EXACT STEPSIZE RULE

In this paper, we give some convergence results on the gradient projection method with exact stepsize rule for solving the minimization problem with convex constraints. Especially, we show that if the objective function is convex and its gradient is Lipschitz continuous, then the whole sequence of iterations produced by this method with bounded exact stepsizes converges to a solution of the concerned problem.     

An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem

In this paper, a new type of stepsize, approximate optimal stepsize, for gradient method is introduced to interpret the Barzilai–Borwein (BB) method, and an efficient gradient method with an approximate optimal stepsize for the strictly convex quadratic minimization problem is presented. Based on a multi-step quasi-Newton condition, we construct a new quadratic approximation model to generate an approximate optimal stepsize. We then use the two well-known BB stepsizes to truncate it for improving numerical effects and treat the resulted approximate optimal stepsize as the new stepsize for gradient method. We establish the global convergence and R-linear convergence of the proposed method. Numerical results show that the proposed method outperforms some well-known gradient methods.     

New Inexact Line Search Method for Unconstrained Optimization

We propose a new inexact line search rule and analyze the global convergence and convergence rate of related descent methods. The new line search rule is similar to the Armijo line-search rule and contains it as a special case. We can choose a larger stepsize in each line-search procedure and maintain the global convergence of related line-search methods. This idea can make us design new line-search methods in some wider sense. In some special cases, the new descent method can reduce to the Barzilai and Borewein method. Numerical results show that the new line-search methods are efficient for solving unconstrained optimization problems. The work was supported by NSF of China Grant 10171054, Postdoctoral Fund of China, and K. C. Wong Postdoctoral Fund of CAS Grant 6765700. The authors thank the anonymous referees for constructive comments and suggestions that greatly improved the paper.     

Convergence Properties of Projection and Contraction Methods for Variational Inequality Problems

In this paper we develop the convergence theory of a general class of projection and contraction algorithms (PC method), where an extended stepsize rule is used, for solving variational inequality (VI) problems. It is shown that, by defining a scaled projection residue, the PC method forces the sequence of the residues to zero. It is also shown that, by defining a projected function, the PC method forces the sequence of projected functions to zero. A consequence of this result is that if the PC method converges to a nondegenerate solution of the VI problem, then after a finite number of iterations, the optimal face is identified. Finally, we study local convergence behavior of the extragradient algorithm for solving the KKT system of the inequality constrained VI problem. \keywords{Variational inequality, Projection and contraction method, Predictor-corrector stepsize, Convergence property.} \amsclass{90C30, 90C33, 65K05.} Accepted 5 September 2000. Online publication 16 January 2001.     

一类新的非单调记忆梯度法及其全局收敛性

在非单调Armijo线搜索的基础上提出一种新的非单调线搜索,研究了一类在该线搜索下的记忆梯度法,在较弱条件下证明了其全局收敛性。与非单调Armijo线搜索相比,新的非单调线搜索在每次迭代时可以产生更大的步长,从而使目标函数值充分下降,降低算法的计算量。