层次分析中广义最小偏差法的性质

广义最小偏差法（GLDM）是层次分析中一种重要的排序方法．本文讨论了广义最小偏差法的性质和灵敏度分析问题．     

映象方程多解问题的某些研究

本文用ｆｐ－同伦方法，在一定的技巧和变换的配合下，在紧性条件支持下，研究了赋范线性空间中一类集值映象方程的多解问题。还给出所得理论结果的一个应用。     

Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control

Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N ³. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction.     

A Modified SQP Method and Its Global Convergence

The sequential quadratic programming method developed by Wilson, Han andPowell may fail if the quadratic programming subproblems become infeasibleor if the associated sequence of search directions is unbounded. In [1], Hanand Burke give a modification to this method wherein the QP subproblem isaltered in a way which guarantees that the associated constraint region isnonempty and for which a robust convergence theory is established. In thispaper, we give a modification to the QP subproblem and provide a modifiedSQP method. Under some conditions, we prove that the algorithm eitherterminates at a Kuhn–Tucker point within finite steps or generates aninfinite sequence whose every cluster is a Kuhn–Tucker point.Finally, we give some numerical examples.     

求解一类变形变分不等式的投影收缩算法及其性质

对一类变形的变分不等式：求，使得提出了一类投影收缩算法，并得到了该算法的收敛性及相关性质．     

弹性力学的Lagrange形式：用Routh方法建立弹性有限变形问题的基本方程

将弹性有限变形问题纳入Lagrange力学的理论体系中，并用经典力学中业已存在的Routh方法构建了有限变形平面应变问题和有限变形平面应力问题的基本微分方程，讨论了有限变形大挠度问题vonkarman方程中存在的矛盾进而提出了两种改进方案．     

Ba（n，x）~（134）Cs，~（134）Ba（n，2n）~（133）Ba，

用中子活化法相对于５４Ｆｅ（ｎ，Ｐ）５４Ｍｎ反应，在１３．５０—１４．８０ＭｅＶ中子能区测量了Ｂａ（ｎ，ｘ）１３４Ｃｓ，１３４Ｂａ（ｎ，２ｎ）１３３Ｂａ，１４０Ｃｅ（ｎ，２ｎ）１３９Ｃｅ，１４２Ｃｅ（ｎ，２ｎ）１４１Ｃｅ和２３Ｎａ（ｎ，２ｎ）２２Ｎａ的反应截面．并将所测的结果和其他作者的结果进行了比较，中子能量是用９０Ｚｒ（ｎ，２ｎ）８９ｍ＋ｇＺｒ反应和９３Ｎｂ（ｎ，２ｎ）９２ｍＮｂ反应截面比法测定的。     

Vibrational control of crystal growth from liquid phase

Modeling and numerical simulations of the convective flows induced by the vibration of the monocrystal during crystal growth have been performed for two configurations simulating the Cz and FZ methods. This permitted to emphasize the role of different vibrational mechanisms in the formation of the average flows. It is shown that an appropriate combination of these mechanisms can be used to counteract the usual convective flows (buoyancy- and/or thermocapillary-driven) inherent to crystal growth processes from the liquid phase. While vibrational convection is rather complex due to these identified mechanisms, the new modeling used in the present paper opens up very promising perspectives to efficiently control heat and mass transfer during real industrial applications of crystal growth from the liquid phase.     

电流并联负反馈放大器实验的研究

用实验的方法，研究电流并联负反馈对放大器性能的改善，提出电流型、并联型负反馈放大器性能参数的测量方法。     

A globally convergent Newton method for solving strongly monotone variational inequalities

Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method.