连续型凸动态规划的离散近似迭代法研究

为解决连续型凸动态规划的“维数灾”问题,提出了一种新的算法—离散近似迭代法.该算法的基本思路为:首先,将连续型状态变量离散化,根据网络图的构造方法将动态规划问题转化为多阶段有向赋权图;其次,运用极大代数求出起点至终点的最短路,即获得模型的一个可行解;最后,以该可行解为基础,继续迭代直到前后两个可行解非常接近.文章还证明了该算法的收敛性和线性收敛,并以一个具体例子验证了算法的有效性.     

搜索区域自动变更的智能水滴算法实训课排课优化

排课问题是NP完全问题,高校实训室排课需考虑实训设备配置及教学改革"走班制"专业选修课所增加的排课复杂度.将高校实训室排课问题建模为硬约束目标及软约束优化满足问题,提出了经过改进的智能水滴算法,改进算法在路径寻优过程中根据待排课程的属性与当前排课状态,结合优化目标,自动进行跳转或围绕核心点变更搜索区域,有效解决了标准智能水滴算法搜索范围固定不利于算法搜索效率提升的问题.提出了预排序策略,减轻算法后期运行的阻力,在排课资源紧张的情况下,更好地实现收敛.通过改进智能水滴算法、标准智能水滴算法、遗传算法进行排课实验对比,验证了改进智能水滴算法在排课系统中的优化效果和高效性。     

多阶段均值-半绝对偏差模糊投资组合优化研究

考虑交易成本和交易量限制,提出投资组合的收益率的隶属函数为梯形的多阶段均值-半绝对偏差可能性投资组合模型,并用自创算法——离散近似迭代法求解.其基本思路为:将连续型状态变量离散化,根据网络图的构造方法将上述模型转化多阶段赋权有向图;运用极大代数求出起点至终点的最长路程,即获得模型的一个可行解;以该可行解为基础,继续迭代直到前后两个可行解非常接近.文章还证明了该方法的线性收敛.最后,文章以一个具体的算例验证了该算法的有效性.     

非线性整数规划的一个新的无参数填充函数算法

离散填充函数是一种用于求解多极值优化问题最优解的一种行之有效的方法.已被证明对于求解大规模离散优化问题是有效的.本文基于改进的离散填充函数定义,构造了一个新的无参数填充函数,并在理论上给出了证明,提出了一个新的填充函数算法.该填充函数无需调节参数,而且只需极小化一次目标函数.数值结果表明,该算法是高效的、可行的.     

均值—动态VaR多阶段投资组合优化研究

将动态风险度量方法运用到多阶段投资组合中,提出了具有交易成本和交易量限制的均值—动态VaR多阶段投资组合模型,并运用自创算法——离散近似迭代法求解.方法的基本思路为:首先,将模型中的连续型状态变量离散化,并将上述模型转化多阶段赋权有向图,然后,运用极大代数求出起点至终点的最长路程,即获得模型的一个可行解;最后,以该可行解为基础,继续迭代直到前后两个可行解非常接近.证明了该方法的收敛性,并以一个具体的算例,验证了该算法可以较快地计算出不同终期财富所对应的最优投资策略.     

基于课程表的智能分析回溯算法的研究

用回溯算法解决排课问题是目前排课软件最为常用的算法,但有很多弊端.为了使得到的课表符合硬、软件约束,并具有较高的适应度,在运用回溯算法进行排课时,我们在进行分配的过程中引入评价机制,确保每一步都是比较优化的选择,从而使整个排课结果也比较优化,实现评价机制的关键是编码和对应的适应度评价的函数.     

新中考中的排课问题

为提高初中学业水平和综合素质教育,近几年有些地方中考进行改革,要求学生进行学科选择。新中考课程分为选修和必修两大类。必修课程为语文、数学、英语,选修课程为其他六门课程,从中选出三项。把最后总成绩作为中考录取的标准。跟传统排课不同,这里排课要求每人一张课表,问题变得复杂困难。本文以北京某初三课程为例,研究了新中考的排课问题。一般情况下约束和变量是上百万级的,无法求解。本文利用整数规划建模,然后把该问题转化成多阶段问题,每个阶段给出小问题的解,这样使得问题的求解变得可行。最终的排课结果,仅比预期增加三位老师就可以实现新中考的排课问题。本文的求解过程给新中考排课带来了新的启发。     

左截断右删失数据下离散型寿命失效率变点模型的Bayes参数估计

利用EM算法和MCMC方法得到了左截断右删失数据下离散型寿命失效率变点模型的参数估计.利用筛选法对缺失数据进行填充,对各参数进行Gibbs抽样.随机模拟证实方法可行且参数估计的精度较高.     

多阶段M-SV投资组合优化的离散近似迭代法研究

文章提出了离散近似迭代法,用该方法求解具有交易成本和交易量限制的多阶段均值一半方差(M-sV)投资组合模型.离散近似迭代方法的基本思路为:首先,将连续型状态变量离散化,根据网络图的构造方法将上述模型转化多阶段赋权有向图;其次,运用嘉量原理求出起点至终点的最长路程,即获得模型的一个可行解;最后,以该可行解为基础,继续迭代直到前后两个可行解非常接近.文章还证明了该方法的收敛性和复杂性.     

基于离散近似迭代法的多阶段M-V投资组合优化

提出了离散近似迭代方法,并用该方法求解具有交易成本和交易量限制的多阶段均值-方差(M-V)投资组合模型.离散近似迭代方法的基本思路为:首先,将连续型状态变量离散化,根据网络图的构造方法将上述模型转化多阶段赋权有向图;其次,运用嘉量原理求出起点至终点的最长路程,即获得模型的一个可行解;最后,以该可行解为基础,继续迭代直到前后两个可行解非常接近.还证明了该方法的收敛性和复杂性.     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

Boundedness for commutators of multipliers on Hardy type spaces

In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p（R^n） into the Lebesgue space L^p with p 〈 1.     

A unified approach to certain problems of best local approximation

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.     

Towards Excellence in Science Chinese Academy of Sciences

<正>May 26,2014,Beijing Science is a human enterprise in the pursuit of knowledge.The scientific revolution that occurred in the 17th Century initiated the advances of modern science.The scientific knowledge system created by     

THE 8~(th) INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS

<正>August 10-14,2015Beijing,ChinaThe International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.     

Boundedness of commutators related to Marcinkiewicz integrals on hardy type spaces

In this paper, the authors study the boundedness of the operator [μΩ, b], the commutator generated by a function b ∈ Lipβ(Rn)(0 ＜β≤ 1) and the Marcinkiewicz integrals μΩ, on the classical Hardy spaces and the Herz-type Hardy spaces in the case Ω∈ Lipα(Sn-1)(0 ＜α≤ 1).     

Generalization of the interaction between Haar approximation and polynomial operators to higher order methods

In applications it is useful to compute the local average empirical statistics on u. A very simple relation exists when of a function f（u） of an input u from the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation.     

Jacobi polynomials used to invert the laplace transform

Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find an approximation to f(t) by the use of the classical Jacobi polynomials. The main contribution of our work is the development of a new and very effective method to determine the coefficients in the finite series expansion that approximation f(t) in terms of Jacobi polynomials. Some numerical examples are illustrated.