一般约束最优化拓广的强次可行方向法

本文讨论非线性等式与不等式最优化问题,引进一个拟罚函数及其相应的只带不等式约束的辅助问题,然后采用广义投影技术和强次可行方向法思想建立原问题的一个全局收敛新算法,该算法具有初点始任意,结构简单,计算量较小等特点。     

一般约束最优化的拟乘子—强次可行方向法

本文讨论一般等式和不等式约束的优化问题，首先提出了问题的拟Ｋｕｈｎ－Ｔｕｃｋｅｒ点和拟乘子法两个新概念，然后借助于不等式约束优化问题强次可行方向法的思想和技巧建立问题的两个新算法。     

非线性最优化一个超线收敛的可行下降算法

本文讨论非线性等式和不等式约束最优化的求解方法。首先将原问题扩充成一个只含不等式约束的参数规划，对于充分大的参数，扩充问题与原问题是等价的。然手建立具有以下特点的一个新算法。１）算法对扩充问题而言是可行下降的，参数只须自动调整有限次；２）每次迭代仅需解一个二次规划；３）在适当的假设下，算法超线性收敛于原问题的最优解。     

带有不等式约束的全局最优性条件

本文利用不连续罚函数方法将带有不等式约束的全局优化问题的求解转化为 讨论一非线性方程的求根问题,从而得到若干个全局最优性条件.     

关于单调的变分不等式问题的收敛性方法

１引言变分不等式的性质及解法的研究是优化领域的重要课题．所谓变分不等式问题就是：寻找一个点,使得其中Ｘ是Ｒｎ中的非空闲凸集,Ｆ是Ｒｎ中的映射,表示Ｒｎ中的内积．求解问题（１．１）有多种思路［１,４,５］其中之一就是将（１．１）转化为它的某种等价问题,再进行求解．在山中ＭａｓａｏＦｕｋｕｓｈｉｍａ给出了（１．１）的如下的等价问题Ｇ是对称正定矩阵．山提出了求解（１．２）的带精确搜索和Ａｒｍｉｊｏ搜索的两种收敛性算法．本文建立了“ｄ－ｆｕｎｃｔｉｏｎ”的概念,利用“Ｄ－ｆｕｎｃｔｉｎ”给出了（１．１）…     

变分不等式的几类求解方法

本文转为系统地分析和概述了变分不等式问题中几类占有重要地位的求解方法,包括方法产生的背景,主要结果及应用等,这几类算法分别为连续算法,（拟）牛顿型算法,一般迭代模型,投影算法,投影收缩算法等。     

基于双参数罚函数求解约束优化问题的一个新算法

对于含约束不等式的最优化问题给出了一种双参数罚函数形式,在文[7]的拟牛顿算法的基础上提出了一个同时改变双参数罚函数的新算法,研究了它的收敛性,数值实验表明了该算法是有效的.     

向量最优化弱有效解的特征和存在性

研究多目标凸向量优化问题在Gateaux可微条件下弱有效解的特性,并讨论一类非凸向量最优化问题弱有效解及与一变分不等式的等价性,给出了解的存在性。     

不等式约束最优化无严格互补条件下的快速收敛序列线性方程组算法

本文讨论无严格互补性的非线性不等式约束最优化问题,建立了一个新的序列线性方程组算法。算法每次迭代只需解一个线性方程组或计算一次广义梯度投影,并不要求Lagrange函数的近似Hessian阵正定。在较弱的假设下,证明了算法的整体收敛性、强收敛性、超线性收敛性及二次收敛速度。还对算法进行了有效的数值试验。     

线性约束三次规划问题的全局最优性必要条件和最优化算法

讨论了带线性不等式约束三次规划问题的最优性条件和最优化算法. 首先, 讨论了带有线性不等式约束三次规划问题的 全局最优性必要条件. 然后, 利用全局最优性必要条件, 设计了解线性约束三次规划问题的一个新的局部最优化算法(强局部最优化算法). 再利用辅助函数和所给出的新的局部最优化算法, 设计了带有线性不等式约束三 规划问题的全局最优化算法. 最后, 数值算例说明给出的最优化算法是可行的、有效的.     

泛系分析:数学·方法论·相对论·辩证思维

基于对广义系统、泛导、泛对称、泛箱原理、泛系相对性提出了新的分析模式与新的相对数学化的简化强化的定义,发展了泛系方法论与泛系相对论的框架与理法,具体内容涉及:相对普适的数学化的泛系,200类对偶,对偶转化,泛对称转化,泛系辩证,八畴方法,泛系数学方法,广义量化,逼近转化原则,泛等价定理,供求分析,思维实验,广义灰色系统,等等.     

Transverse compression of PPTA fibers

Results of single transverse compression testing of PPTA and PIPD fibers, using a novel test device, are presented and discussed. In the tests, short lengths of single fibers are compressed between two parallel, stiff platens. The fiber elastic deformation is analyzed as a Hertzian contact problem. The inelastic deformation is analyzed by elastic-plastic FE simulation and by laser-scanning confocal microscopy of the compressed fibers ex post facto. The results obtained are compared to those in the literature and to the theoretical predictions of PPTA fiber transverse elasticity based on PPTA crystal elasticity.Presented at the 11th International Conference on Mechanics of Composite Materials (Riga, June 11–15, 2000).3TEX, Inc. 109, MacKenan Drive, Cary, North Carolina 27511, USA. Published in Mekhanika Kompozitnykh Materialov, Vol. 36, No. 4, pp. 533–544, March–April, 2000.     

区组长为奇素数的自反MD设计

本文利用差方法对自反MD设计SCMD(4mp,p,1)的存在性给出了构造性证明,这里p为奇素数,m为正整数．     

Formulation of linear problems and solution by a universal machine

Using the predicate language for ordered fields a class of problems referred to aslinear problems is defined. This class contains, for example, all systems of linear equations and inequalities, all linear programming problems, all integer programming problems with bounded variables, all linear complementarity problems, the testing of whether sets that are defined by linear inequalities are semilattices, all satisfiability problems in sentenial logic, the rank-computation of matrices, the computation of row-reduced echelon forms of matrices, and all quadratic programming problems with bounded variables. A single, one, algorithm, to which we refer as theUniversal Linear Machine, is described. It solves any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates alinear algorithm for the problem. Then, given an instance of the linear problem, in the second phase the linear algorithm solves the particular instance of the linear problem. The linear algorithm is finite, deterministic, loopless and executes only the five ordered field operations — additions, multiplications, subtractions, divisions and comparisons. Conversely, we show that for each linear algorithm there is a linear problem which the linear algorithm solves uniquely. Finally, it is shown that with a linear algorithm for a linear problem, one can solve certain parametric instances of the linear problem.Research was supported in part by the National Science Foundation Grant DMS 92-07409, by the Department of Energy Grant DE-FG03-87-ER-25028, by the United States—Israel Binational Science Foundation Grant 90-00434 and by ONR Grant N00014-92-J1142.Corresponding author.     

Professor Sun Yongsheng

Sun Yongsheng, professor of mathematics, was born on January 22, 1929, in Wanghaisi Village, Cang County, Hebei Province, China. He died of lung cancer at 23 hour 15 minutes,March 22, 2006 in Beijing.     

Immersive Projection Technology for Visual Data Mining

The PlatoCAVE, the MiniCAVE, and the C2 are immersive stereoscopic projectionbased virtual reality environments oriented toward group interactions. As such they are particularly suited to collaborative efforts in data analysis and visual data mining. In this article, we provide an overview of virtual reality in general, including immersive projection technology, and the use of stereoscopic displays for data visualization. We discuss design considerations for the construction of these immersive environments including one-wall versus four-wall implementations, augmented reality, stereoscopic placement, head tracking, the use of LCD devices, polarized light stereo, voice control, and image synchronization.     

Components of the Fundamental Category II

In this article we carry on the study of the fundamental category (Goubault and Raussen, Dihomotopy as a tool in state space analysis. In: Rajsbaum, S. (ed.) LATIN 2002: Theoretical Informatics. Lecture Notes in Computer Science, vol. 2286, Cancun, Mexico, pp. 16–37, Springer, Berlin Heidelberg New York, 2002; Goubault, Homology, Homotopy Appl., 5(2): 95–136, 2003) of a partially ordered topological space (Nachbin, Topology and Order, Van Nostrand, Princeton, 1965; Johnstone, Stone Spaces, Cambridge University Press, Cambridge, MA, 1982), as arising in e.g. concurrency theory (Fajstrup et al., Theor. Comp. Sci. 357: 241–278, 2006), initiated in (Fajstrup et al., APCS, 12(1): 81–108, 2004). The “algebra” of dipaths modulo dihomotopy (the fundamental category) of such a po-space is essentially finite in a number of situations. We give new definitions of the component category that are more tractable than the one of Fajstrup et al. (APCS, 12(1): 81–108, 2004), as well as give definitions of future and past component categories, related to the past and future models of Grandis (Theory Appl. Categ., 15(4): 95–146, 2005). The component category is defined as a category of fractions, but it can be shown to be equivalent to a quotient category, much easier to portray. A van Kampen theorem is known to be available on fundamental categories (Grandis, Cahiers Topologie Géom. Différentielle Catég., 44: 281–316, 2003; Goubault, Homology, Homotopy Appl., 5(2): 95–136, 2003), we show in this paper a similar theorem for component categories (conjectured in Fajstrup et al. (APCS, 12(1): 81–108, 2004). This proves useful for inductively computing the component category in some circumstances, for instance, in the case of simple PV mutual exclusion models (Goubault and Haucourt, A practical application of geometric semantics to static analysis of concurrent programs. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005 – Concurrency Theory: 16th International Conference, San Francisco, USA, August 23–26. Lecture Notes in Computer Science, vol. 3653, pp. 503–517, Springer, Berlin Heidelberg New York, 2005), corresponding to partially ordered subspaces of R ⁿ minus isothetic hyperrectangles. In this last case again, we conjecture (and give some hints) that component categories enjoy some nice adjunction relations directly with the fundamental category.      

Splitting up value: A critical review of residual income theories

This paper deals with the notion of residual income, which may be defined as the surplus profit that residues after a capital charge (opportunity cost) has been covered. While the origins of the notion trace back to the 19th century, in-depth theoretical investigations and widespread real-life applications are relatively recent and concern an interdisciplinary field connecting management accounting, corporate finance and financial mathematics (Peasnell, 1981, 1982; Peccati, 1987, 1989, 1991; Stewart, 1991; Ohlson, 1995; Arnold and Davies, 2000; Young and O’Byrne, 2001; Martin, Petty and Rich, 2003). This paper presents both a historical outline of its birth and development and an overview of the main recent contributions regarding capital budgeting decisions, production and sales decisions, implementation of optimal portfolios, forecasts of asset prices and calculation of intrinsic values. A most recent theory, the systemic-value-added approach (also named lost-capital paradigm), provides a different definition of residual income, consistent with arbitrage theory. Enfolded in Keynes’s (1936) notion of user cost and forerun by Pressacco and Stucchi (1997), the theory has been formally introduced in Magni (2000a,b,c; 2001a,b; 2003), where its properties are thoroughly investigated as well as its relations with the standard theory; two different lost-capital metrics have been considered, for value-based management purposes, by Drukarczyk and Schueler (2000) and Young and O’Byrne (2001). This work illustrates the main properties of the two theories and their relations, and provides a minimal guide to construction of performance metrics in the two approaches.     

Financial Risk Modelling and Econometric Inference

In finance, the explicit modelling of uncertainty takes on a particularly important role. The values of financial derivatives increase in the return volatility of the underlying security. This notion requires a concept of volatility and hence uncertainty. In addition, the choice between modelling in discrete and continuous time is not arbitrary, since it corresponds to a distinction between incomplete and complete markets, respectively, and this distinction matters for asset pricing, financial risk modelling, and inference. Risk and volatility are closely connected, and implied volatility, volatility forecasting, volatility in term structure models, stochastic volatility, and portfolio analysis are considered and related to a more general interplay between cross-sectional and dynamic aspects in finance. Stocks, bonds, and options are considered and placed in the context of efficiency and separation in inference.