Steepest Descent, CG, and Iterative Regularization of Ill-Posed Problems

The state of the art iterative method for solving large linear systems is the conjugate gradient (CG) algorithm. Theoretical convergence analysis suggests that CG converges more rapidly than steepest descent. This paper argues that steepest descent may be an attractive alternative to CG when solving linear systems arising from the discretization of ill-posed problems. Specifically, it is shown that, for ill-posed problems, steepest descent has a more stable convergence behavior than CG, which may be explained by the fact that the filter factors for steepest descent behave much less erratically than those for CG. Moreover, it is shown that, with proper preconditioning, the convergence rate of steepest descent is competitive with that of CG.This revised version was published online in October 2005 with corrections to the Cover Date.     

单侧障碍问题解梯度的Hlder连续性

对1相似文献   

TESTING DIFFERENT CONJUGATE GRADIENT METHODS FOR LARGE—SCALE UNCONSTRAINED OPTIMIZATION

In this PaPer we test different conjugate gradient (CG) methods for solving large-scale unconstrained optimization problems.The methods are divided in two groups:the first group includes five basic CG methods and the second five hybrid CG methods.A collection of medium-scale and large-scale test problems are drawn from a standard code of test problems.CUTE.The conjugate gradient methods are ranked according to the numerical results.Some remarks are given.     

应用自动微分的Newton-PCG算法

一类新的使用符号微分的Newton-PCG型算法在文献[1]和[2]被导出来了。本文建立和研究应用自动微分的相应的Newton-PCG算法，理论分析和数值实验结果显示应用自动微分之后，目标函数的维数或复杂性越大，Newton-PCG算法对Newton法的改进越显著。     

共轭下降法的全局收敛性

本文提出了一种Armijo型的线搜索，并在这种线搜索下讨论了共轭下降法的全局收敛性，且可得方法在每次迭代均产生一个下降搜索方向．     

线性约束最优化的一个共轭投影梯度法

本结合共轭梯度法及梯度投影法的思想,建立线性等式约束最优化的一个新算法,称之为共轭投影梯度法。分别对二次凸目标函数和一般目标函数分析和论证了算法的重要性质和收敛性。     

一类共轭梯度法的全局收敛性结果

本文证明了在Grippo-Lucidi线搜索下当βk取βk=σ1βPRPk+σ2βnewk,其中σ1≥0,σ2≥0,σ1+σ2＞0,βnewk=gTk(gk-gk-1)/-dTk-1gk-1时一类共轭梯度法的全局收敛性,并给出了此类方法良好的数值效果.     

Hyperbolic mean growth of bounded holomorphic functions in the ball

We consider the hyperbolic Hardy class , . It consists of holomorphic in the unit complex ball for which and

where denotes the hyperbolic distance of the unit disc. The hyperbolic version of the Littlewood-Paley type -function and the area function are defined in terms of the invariant gradient of , and membership of is expressed by the property of the functions. As an application, we can characterize the boundedness and the compactness of the composition operator , defined by , from the Bloch space into the Hardy space .

     

Convergence rates for steady-state derivative estimators

We describe various derivative estimators for the case of steady-state performance measures and obtain the order of their convergence rates. These estimatorsdo not use explicitly the regenerative structure of the system. Estimators based on infinitesimal perturbation analysis, likelihood ratios, and different kinds of finite-differences are examined. The theoretical results are illustrated via numerical examples.     

Ab-initio simulation of elastic constants for some ceramic materials

Athermal elasticity for some ceramic materials (α-Al₂O₃, SiC (α and β phases), TiO₂ (rutile and anatase), hexagonal AlN and TiB₂, cubic BN and CaF₂, and monoclinic ZrO₂) have been investigated via density functional theory. Energy-volume equation-of-state computations to obtain the zero pressure equilibrium volume and bulk modulus as well as computations of the full elastic constant tensor of these ceramics at the experimental zero pressure volume have been performed. The present results for the single crystal elasticity are in good agreement with experiments both for the aggregate properties (bulk and shear modulus) and the elastic anisotropy. In contrast, a considerable discrepancy for the zero pressure bulk modulus of some ceramics evaluated from the energy-volume fit to the computational zero pressure volume has been observed.