摘要:The authors study the convergence properties of the damped Gauss-Newton algorithm which was originally proposed by Subramamian for the complementarity problem.The aim of this paper is to give a global convergence result under conditions weaker than those in the literature.The result here has improved and generalized those of Subramanian P K(1993 and 1997).%研究了由Subramamian为求解互补问题提出的阻尼Gauss-Newton方法的收敛性质,在较弱的条件下,给出了一个全局收敛结果,这个结果是Subramanian P K(1993)和(1997)中相应结果的一个推广.
摘要:设D是一2-(v,k,1)设计,G为D上的区传递,点本原且非旗传递的自同构群. 如果G=PSpn(q)(n≥14,q为偶数),则下列之一成立:(1) GP∈C1且GP不是SPm(q)⊥SPn-m(q)型的(m≥4); (2) GP∈C8.%Let D be a 2-(v, k, 1) design, G≤Aut(D) be block-transitive, point-primitive but not flat-transitive. If G=PSpn(q), with n≥14 and q even, then one of the following holds: (1) GP∈C1 and GP is not of type Spm(q)⊥Spn-m(q), with m≥4; (2) GP∈C8.