您的位置: 专家智库 > >

国家自然科学基金(10771133)

作品数:13 被引量:18H指数:3
相关作者:姚奕荣郑权韩伯顺白延琴金正静更多>>
相关机构:上海大学浙江林学院更多>>
发文基金:国家自然科学基金上海市教育委员会重点学科基金国家教育部博士点基金更多>>
相关领域:理学建筑科学经济管理更多>>

文献类型

  • 13篇中文期刊文章

领域

  • 11篇理学
  • 1篇经济管理
  • 1篇建筑科学

主题

  • 2篇最优性
  • 2篇APPROA...
  • 2篇BARRIE...
  • 1篇英文
  • 1篇约束问题
  • 1篇运筹
  • 1篇运筹学
  • 1篇障碍函数
  • 1篇凸二次规划
  • 1篇凸二次规划问...
  • 1篇全局优化
  • 1篇最优性条件
  • 1篇线性规划
  • 1篇内点方法
  • 1篇积分
  • 1篇积分型
  • 1篇极小点
  • 1篇交叉熵
  • 1篇交叉熵方法
  • 1篇规划问题

机构

  • 6篇上海大学
  • 1篇浙江林学院

作者

  • 4篇姚奕荣
  • 3篇郑权
  • 1篇金正静
  • 1篇梁泽亮
  • 1篇陈熙
  • 1篇安柳
  • 1篇白延琴
  • 1篇韩伯顺
  • 1篇陆贵斌
  • 1篇张连生
  • 1篇王筱莉
  • 1篇陈柳

传媒

  • 5篇Journa...
  • 2篇运筹学学报(...
  • 1篇应用数学和力...
  • 1篇上海大学学报...
  • 1篇数学年刊(A...
  • 1篇运筹与管理
  • 1篇Applie...
  • 1篇Scienc...

年份

  • 2篇2012
  • 2篇2010
  • 8篇2009
  • 1篇2008
13 条 记 录,以下是 1-10
排序方式:
非线性规划的一个罚内点方法被引量:4
2008年
针对具有不等式约束的非线性规划,结合罚内点途径,且在牛顿法的基础上,提出一个算法.通过引入辅助变量松弛不等式约束,把约束集合转化为两个集合的交集:一个是容易计算内点的,另一个是简单线性的.这样就提出了解决此问题的一个新的障碍和罚函数方法且给出了其方法的一般收敛性结果.对接近度量和算法参数的选择途径也进行了研究,从而程序上保证了一旦障碍参数被更新,算法仅需要有限牛顿步就能达到近似中心.数值例子说明了方法的有效性.
姚奕荣张连生
关键词:内点方法障碍函数罚函数非线性规划
General space-efficient sampling algorithm for suboptimal alignment
2009年
Suboptimal alignments always reveal additional interesting biological features and have been successfully used to informally estimate the significance of an optimal alignment. Besides, traditional dynamic programming algorithms for sequence comparison require quadratic space, and hence are infeasible for long protein or DNA sequences. In this paper, a space-efficient sampling algorithm for computing suboptimal alignments is described. The algorithm uses a general gap model, where the cost associated with gaps is given by an affine score, and randomly selects an alignment according to the distribution of weights of all potential alignments. If x and y are two sequences with lengths n and m, respectively, then the space requirement of this algorithm is linear to the sum of n and m. Finally, an example illustrates the utility of the algorithm.
陈燚白延琴
可达到和可逼近总极小点的存在性和最优性(英文)
2012年
针对积分总极值,讨论并拓展了丰满集和丰满函数的概念,研究了拟上丰满和伪上丰满函数的总极值问题.在总极值的变差积分最优性条件下,证明了拟上丰满函数的可达到极小点和伪上丰满函数的可逼近极小点的存在性.
姚奕荣安柳陈熙郑权
财务脆弱性问题的报童模型
2009年
在品牌渠道体系的建设过程中,除了对利润最大化的追求以外,财务上的脆弱性/柔性会极大地影响着经销商的决策心理和商业行为实践。本文着重考察单位产品利润率和剩余产品处理费用对经销商决策心理和行为的影响,通过分析零售商的收益分布状况,再基于展望理论的思路,建立了参考点取决于损益状况的报童展望模型。最后证明,财务脆弱性将更大地发挥损失厌恶型决策者的保守心理。
陆贵斌
关键词:脆弱性报童
Reduction of truss topology optimization
2009年
A reduction of truss topology design problem formulated by semidefinite optimization (SDO) is considered. The finite groups and their representations are introduced to reduce the stiffness and mass matrices of truss in size. Numerical results are given for both the original problem and the reduced problem to make a comparison.
孙艳白延琴周轶凯
关键词:REDUCTION
Discontinuous penalty approach with deviation integral for global constrained minimization被引量:1
2009年
In this paper, we use the discontinuous exact penalty functions to solve the constrained minimization problems with an integral approach. We examine a general form of the constrained deviation integral and its analytical properties. The optimality conditions of the penalized minimization problems are proven. To implement the al- gorithm, the cross-entropy method and the importance sampling are used based on the Monte-Carlo technique. Numerical tests show the effectiveness of the proposed algorithm.
陈柳姚奕荣郑权
总极值问题的几种变差积分算法的实现比较
2012年
构造3种类型的变差积分,并运用它们来研究和求解总极值问题.针对不同的变差积分算法,结合Monte-Carlo技术,分别对100个变量的具体实例进行算法实现.数值试验结果表明,所设计的变差积分算法对不同的目标函数都有优势。
王筱莉梁泽亮姚奕荣郑权
关键词:最优性条件MONTE-CARLO方法
变差积分型约束总极值问题的不连续罚途径被引量:3
2009年
结合积分途径运用不连续精确罚函数来求解全局约束最小化问题.进一步,提出了约束变差积分的一般形式并证明了其分析性质,同时也给出并证明了其全局最优性条件,并由此设计了一个新算法.基于Monte-Carlo模拟技术,运用交叉熵方法和重要样本实现了该算法.数值实验也说明了这个新算法是有效的.
陈柳姚奕荣郑权
关键词:全局优化约束问题交叉熵方法
Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
2009年
The choice of self-concordant functions is the key to efficient algorithms for linear and quadratic convex optimizations, which provide a method with polynomial-time iterations to solve linear and quadratic convex optimization problems. The parameters of a self-concordant barrier function can be used to compute the complexity bound of the proposed algorithm. In this paper, it is proved that the finite barrier function is a local self-concordant barrier function. By deriving the local values of parameters of this barrier function, the desired complexity bound of an interior-point algorithm based on this local self-concordant function for linear optimization problem is obtained. The bound matches the best known bound for small-update methods.
金正静白延琴
Interior-point algorithm based on general kernel function for monotone linear complementarity problem
2009年
A polynomial interior-point algorithm is presented for monotone linear complementarity problem (MLCP) based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.
刘勇白延琴
共2页<12>
聚类工具0