等式与界约束非线性优化信赖域算法的全局收敛

§ 1　ＩｎｔｒｏｄｕｃｔｉｏｎＣｏｎｓｉｄｅｒｔｈｅｆｏｌｌｏｗｉｎｇｎｏｎｌｉｎｅａｒｏｐｔｉｍｉｚａｔｉｏｎｐｒｏｂｌｅｍ :ｍｉｎｉｍｉｚｅｆ(ｘ)ｓｕｂｊｅｃｔｔｏＣ(ｘ) =0 ,　ａ≤ｘ≤ｂ ,( 1 .1 )ｗｈｅｒｅｆ(ｘ) :Ｒｎ→Ｒ ,Ｃ(ｘ) =(ｃ1(ｘ) ,ｃ2 (ｘ) ,...,ｃｍ(ｘ) ) Ｔ:Ｒｎ→Ｒｍ ａｒｅｔｗｉｃｅｃｏｎｔｉｎｕｏｕｓｌｙｄｉｆｆｅｒｅｎｔｉａｂｌｅ,ｍ≤ｎ ,ａ ,ｂ∈Ｒｎ.Ｔｒｕｓｔｒｅｇｉｏｎａｌｇｏｒｉｔｈｍｓａｒｅｖｅｒｙｅｆｆｅｃｔｉｖｅｆｏｒｓｏｌｖｉｎｇｎｏｎｌｉｎｅａｒｏｐｔｉｍｉ…     

A closed-form representation of mixed-integer program value functions

We identify a class of formulas computable in polynomial time such that the functions defined by these formulas are precisely the value functions of mixed-integer programs with rational constraint coefficients.     

Mathematical analysis of investment systems

Investment systems are studied using a framework that emphasize their profiles (the cumulative probability distribution on all the possible percentage gains of trades) and their log return functions (the expected average return per trade in logarithmic scale as a function of the investment size in terms of the percentage of the available capital). The efficiency index for an investment system, defined as the maximum of the log return function, is proposed as a measure to compare investment systems for their intrinsic merit. This efficiency index can be viewed as a generalization of Shannon's information rate for a communication channel. Applications are illustrated.     

Analyzing the effect of the inventory policy on order and inventory variability with linear control theory

In this paper we apply linear control theory to study the effect of various inventory policies on order and inventory variability, which are key drivers of supply chain performance. In particular, we study a two-echelon supply chain with a stationary demand pattern under the influence of three inventory policies: an inventory-on-hand policy that bases orders on the visible inventory at an installation, an installation-stock policy that bases orders on the inventory position (on-hand plus on-order inventory) at an installation, and an echelon-stock policy that bases orders on the inventory position at that installation and all downstream installations. We prove analytically that the inventory-on-hand policy is unstable in practical settings, confirming analytically what has been observed in experimental settings and in practice. We also prove that the installation-stock and echelon-stock policies are stable and analyze their effect on order and inventory fluctuation. Specifically, we show the general superiority of the echelon-stock in our setting and demonstrate analytically the effect of forecasting parameters on order and inventory fluctuations, confirming the results in other research.     

求解无线传感器网络路由问题的蚁群最优化算法及其收敛性

首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明．最后对找到最优解后信息素值的变化进行了分析．即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值．     

2‐Cyanoprop‐2‐yl dithiobenzoate mediated reversible addition–fragmentation chain transfer polymerization of acrylonitrile targeting a polymer with a higher molecular weight

The reversible addition–fragmentation chain transfer (RAFT) polymerization of acrylonitrile (AN) mediated by 2‐cyanoprop‐2‐yl dithiobenzoate was first applied to synthesize polyacrylonitrile (PAN) with a high molecular weight up to 32,800 and a polydispersity index as low as 1.29. The key to success was ascribed to the optimization of the experimental conditions to increase the fragmentation reaction efficiency of the intermediate radical. In accordance with the atom transfer radical polymerization of AN, ethylene carbonate was also a better solvent candidate for providing higher controlled/living RAFT polymerization behaviors than dimethylformamide and dimethyl sulfoxide. The various experimental parameters, including the temperature, the molar ratio of dithiobenzoate to the initiator, the molar ratio of the monomer to dithiobenzoate, the monomer concentration, and the addition of the comonomer, were varied to improve the control of the molecular weight and polydispersity index. The molecular weights of PANs were validated by gel permeation chromatography along with a universal calibration procedure and intrinsic viscosity measurements. ¹H NMR analysis confirmed the high chain‐end functionality of the resultant polymers. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 1272–1281, 2007     

Lagrangian Duality in Set-Valued Optimization

In this paper, we study optimization problems where the objective function and the binding constraints are set-valued maps and the solutions are defined by means of set-relations among all the images sets (Kuroiwa, D. in Takahashi, W., Tanaka, T. (eds.) Nonlinear analysis and convex analysis, pp. 221–228, 1999). We introduce a new dual problem, establish some duality theorems and obtain a Lagrangian multiplier rule of nonlinear type under convexity assumptions. A necessary condition and a sufficient condition for the existence of saddle points are given. The authors thank the two referees for valuable comments and suggestions on early versions of the paper. The research of the first author was partially supported by Ministerio de Educación y Ciencia (Spain) Project MTM2006-02629 and by Junta de Castilla y León (Spain) Project VA027B06.     

解约束优化问题的QP-free可行域方法

本文利用一个新的分片线性NCP函数提出一个新的可行的QP-free方法解非线性不等式约束优化问题.不同于其他的QP-free方法,这个方法只考虑在工作集中的约束函数,工作集是积极集的一个估计,因此子问题的维数不是满秩的.这个方法可行的并且不需假定严格互补条件、聚点的孤立性得到算法的全局收敛性,并且积极约束函数的梯度不要求线性独立的,其中由拟牛顿法得到的子矩阵不需要求一致正定性.     

Corrected mirror systems with double reflection

We propose objectives consisting of two mirrors with central holes for passage of a light beam. The optical layout ensures multiple reflection of rays from both mirrors. We consider several approaches to calculating the design parameters for which three and four aberrations do not occur. The objectives can be used in optical devices operating in the UV and IR regions of the spectrum. __________ Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 74, No. 2, pp. 267–270, March–April, 2007.     

Solving large-scale semidefinite programs in parallel

We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously possible, and acceptable parallel scalability on sufficiently large problems. This work was supported in part by NSF grants DMS-0215373 and DMS-0238008.