Adaptive nonmonotone line search method for unconstrained optimization

In this paper, an adaptive nonmonotone line search method for unconstrained minimization problems is proposed. At every iteration, the new algorithm selects only one of the two directions: a Newton-type direction and a negative curvature direction, to perform the line search. The nonmonotone technique is included in the backtracking line search when the Newton-type direction is the search direction. Furthermore, if the negative curvature direction is the search direction, we increase the steplength under certain conditions. The global convergence to a stationary point with second-order optimality conditions is established. Some numerical results which show the efficiency of the new algorithm are reported.      

A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization

It is well-known that the HS method and the PRP method may not converge for nonconvex optimization even with exact line search. Some globalization techniques have been proposed, for instance, the PRP+ globalization technique and the Grippo-Lucidi globalization technique for the PRP method. In this paper, we propose a new efficient globalization technique for general nonlinear conjugate gradient methods for nonconvex minimization. This new technique utilizes the information of the previous search direction sufficiently. Under suitable conditions, we prove that the nonlinear conjugate gradient methods with this new technique are globally convergent for nonconvex minimization if the line search satisfies Wolfe conditions or Armijo condition. Extensive numerical experiments are reported to show the efficiency of the proposed technique.     

微分方程解的存在区间的确定

从六个方面说明了确定一阶微分方程解的存在区间的方法.     

财务重述对分析师预测行为的影响研究

本文以我国2005-2009年间A股市场发生年度财务报表重述的公司并结合相应的分析师预测数据作为样本,分别考察了财务重述和财务重述调整金额对分析师跟进及预测特征的影响。多元回归结果表明:财务重述会减少分析师跟进、增加分析师预测误差,重述调减以前年度损益的程度越大,分析师预测的分歧和误差就越大;而财务重述增加分析师预测分歧、重述调整金额影响分析师跟进的假设却未得到证实。本研究发展了财务重述、分析师预测的研究内容,为提高公司财务报告质量、规范分析师行业提供了相应的思路。     

Geometric properties of basic hypergeometric functions

In this article, we consider basic hypergeometric functions introduced by Heine. We study the mapping properties of certain ratios of basic hypergeometric functions having shifted parameters and show that they map the domains of analyticity onto domains convex in the direction of the imaginary axis. In order to investigate these mapping properties, some useful identities are obtained in terms of basic hypergeometric functions. In addition, we find conditions under which the basic hypergeometric functions are in a q-close-to-convex family.     

沿法线方向改进非DEA有效DMU

现有的非DEA有效DMU的改进方法造成DMU的投入或产出的波动太大,因而难以进行改进.提出了沿法线方向改进非DEA有效DMU的新方法.可以使非DEA有效DMU尽快到达有效前沿面,成为DEA有效,减小了波动幅度,并结合12所重点理工高校效评价的实际,验证了本方法的优势.     

测算具有方向技术效率的DEA方法

本文总结了现有技术效率的主要测算方法，借鉴定向技术距离函数思想，结合DEA思路，提出了一种新的用于技术效率指数测算的模型，并进一步探讨了如何识别决策单元的技术有效性和如何改进非技术有效决策单元的问题．着重分析了该技术效率指数模型与L型技术效率指数的关系，指出该模型是L型技术效率指数模型的一般形式．     

Efficient algorithms for the matrix cosine and sine

Several improvements are made to an algorithm of Higham and Smith for computing the matrix cosine. The original algorithm scales the matrix by a power of 2 to bring the ∞-norm to 1 or less, evaluates the [8/8] Padé approximant, then uses the double-angle formula cos (2A)=2cos ²A−I to recover the cosine of the original matrix. The first improvement is to phrase truncation error bounds in terms of ‖A²‖^1/2 instead of the (no smaller and potentially much larger quantity) ‖A‖. The second is to choose the degree of the Padé approximant to minimize the computational cost subject to achieving a desired truncation error. A third improvement is to use an absolute, rather than relative, error criterion in the choice of Padé approximant; this allows the use of higher degree approximants without worsening an a priori error bound. Our theory and experiments show that each of these modifications brings a reduction in computational cost. Moreover, because the modifications tend to reduce the number of double-angle steps they usually result in a more accurate computed cosine in floating point arithmetic. We also derive an algorithm for computing both cos (A) and sin (A), by adapting the ideas developed for the cosine and intertwining the cosine and sine double angle recurrences. AMS subject classification 65F30 Numerical Analysis Report 461, Manchester Centre for Computational Mathematics, February 2005. Gareth I. Hargreaves: This work was supported by an Engineering and Physical Sciences Research Council Ph.D. Studentship. Nicholas J. Higham: This work was supported by Engineering and Physical Sciences Research Council grant GR/T08739 and by a Royal Society–Wolfson Research Merit Award.     

Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

In this paper we present a primal-dual inexact infeasible interior-point algorithm for semidefinite programming problems (SDP). This algorithm allows the use of search directions that are calculated from the defining linear system with only moderate accuracy, and does not require feasibility to be maintained even if the initial iterate happened to be a feasible solution of the problem. Under a mild assumption on the inexactness, we show that the algorithm can find an -approximate solution of an SDP in O(n²ln(1/)) iterations. This bound of our algorithm is the same as that of the exact infeasible interior point algorithms proposed by Y. Zhang.Research supported in part by the Singapore-MIT alliance, and NUS Academic Research Grant R-146-000-032-112.Mathematics Subject Classification (1991): 90C05, 90C30, 65K05     

基于"纵横向拉开档次法"的上市公司经营业绩评价

鉴于目前已具有较全面、完整、连续的有关上市公司各项指标的纵横向数据，为充分利用数据所蕴涵的信息，本文提出运用“纵横向拉开档次”的综合评价方法，其特点是使指标权重的确定能尽量将被评价对象在纵横向拉开档次。将该法运用于安徽地方板块的18家上市公司业绩评价，获得了各公司在1999～2001年间动态发展的分析结果。