On duality concepts in fractional programming

The paper (Part I) describes an approach to duality in fractional programming on the basis of another kind of conjugate functions. The connections to some duality concepts (the Lagrange-duality and duality concepts of Craven and Schaible) are investigated and some new proofs of strong duality theorems are given.     

Path-following barrier and penalty methods for linearly constrained problems

In the present paper some barrier and penalty methods (e.g. logarithmic barriers, SUMT, exponential penalties), which define a continuously differentiable primal and dual path, applied to linearly constrained convex problems are studied, in particular, the radius of convergence of Newton’s method depending on the barrier and penalty para-meter is estimated, Unlike using self-concordance properties the convergence bounds are derived by direct estimations of the solutions of the Newton equations. The obtained results establish parameter selection rules which guarantee the overall convergence of the considered barrier and penalty techniques with only a finite number of Newton steps at each parameter level. Moreover, the obtained estimates support scaling method which uses approximate dual multipliers as available in barrier and penalty methods     

Singly Periodic Solutions of the Allen-Cahn Equation and the Toda Lattice

The Allen-Cahn equation ? Δu = u ? u ³ in ?² has family of trivial singly periodic solutions that come from the one dimensional periodic solutions of the problem ?u″ =u ? u ³. In this paper we construct a non-trivial family of singly periodic solutions to the Allen-Cahn equation. Our construction relies on the connection between this equation and the infinite Toda lattice. We show that for each one-soliton solution to the infinite Toda lattice we can find a singly periodic solution to the Allen-Cahn equation, such that its level set is close to the scaled one-soliton. The solutions we construct are analogues of the family of Riemann minimal surfaces in ?³.     

A New Tricarboxylate‐Terbium(III) Compound: Synthesis,Structure, and Luminescent Property

The Tb^III compound [Tb(tci)(H₂O)]_n · n(DMF) ( 1 ) [H₃tci = tri(2‐carboxythyl)isocyanurate, DMF = N,N′‐dimethylformamide] was synthesized by the reaction of terbium oxide, H₃tci, and two drops of concentrated nitric acid in the presence of DMF and H₂O. Single crystal X‐ray analysis reveals that it features a three‐dimensional (3D) framework based on infinite –Tb–COO–Tb– chains. The tci ligand in 1 links six different Tb^III ions with its two carboxylate groups in μ₂‐κ¹O;κ²O,O′ mode and the third in μ₂‐κ¹O;κ¹O′ mode. Thermal analysis reveals that it remains high thermal stability until 390 °C. Luminescence investigation shows that it emits characteristic green light of Tb^III ions.     

High-frequency lengthwise diffraction by the curve separating soft and hard part of the surface

The paper examines the model problem of high-frequency diffraction by a convex surface consisting of two parts. One is soft, the other is hard. The incident wave falls at a small angle to the line which separates soft and hard parts of the surface. The change in the boundary condition provokes the field in the Fock zone to have a rapid transverse variation. This causes a special boundary-layer to be formed. The boundary value problem for the three dimensional parabolic equation is reduced to the Riemann problem solved by the factorization in the form of infinite products containing the zeros of the Airy function and zeros of its derivative. the results of this factorization appear under the sign of double Fourier integral in the representation of the field. Both numerical and asymptotic analysis of this representation is carried out and illustrates the effects of high-frequency diffraction caused by the line of the boundary condition discontinuity.     

基于可靠度的结构优化的序列近似规划算法

基于可靠度的优化的最直观解法是把可靠度和优化的各自算法搭配一起形成嵌套两层次迭代。为改善其收敛性提高计算效率,人们提出了功能测度法、半无限规划法、单层次算法等多种改进方法。本文对传统结构优化界的经典序列近似规划法改造并扩展应用于求解基于可靠度的结构优化问题,构造该问题的序列近似规划模型和求解过程;其核心思想是在每个近似规划子问题中采用近似可靠度指标对设计变量的线性近似,在优化迭代过程中同步更新设计变量和随机空间中的近似验算点坐标,以达到可靠度分析和优化迭代同步收敛的目标。为了算法的实施,还推导出近似可靠度指标的半解析灵敏度计算公式,编制了程序,最终实现与通用软件的连接。论文用算例证实算法的有效性。     

具无限时滞的周期系统的持久性与正周期解

本文利用比较定理,控制收敛定理和积分平均的方法,讨论一类具有无限时滞的非自治,非卷积的捕食者-食饵系统的一致持久性和正周期解。     

L2×L2中的一类无穷维Hamilton算子的剩余谱

该文得到了一类无穷维Hamilton算子的剩余谱和点谱存在的几个判别准则,从而给出 了求其剩余谱和点谱的方法．在此基础上构造了L2×L2中无穷维Hamilton算子的剩余谱 非空的具体例子,从而进一步验证了判别准则的有效性．     

概率约束下最优解的统计影响函数

本文把稳健统计的影响函数概念引入到了概率约束下的随机规划模型中．在一定条件下,得到了三个模型最优解的影响函数表达式．     

Lotka-Volterra型N-种群竞争系统的持久性和稳定性

本文研究一类具有无穷时滞的概周期Lotka-Volterra型N-种群竞争系统的持久性和全局渐近稳定性.一些新的充分条件被得到.