国家自然科学基金(10771133)

作品数:13被引量:15H指数:3
导出分析报告
相关作者:姚奕荣郑权韩伯顺白延琴金正静更多>>
相关机构:上海大学浙江林学院更多>>
相关期刊:《Science China Mathematics》《Applied Mathematics and Mechanics(English Edition)》《应用数学和力学》《上海大学学报(自然科学版)》更多>>
相关主题:APPROACHBARRIERNEWTON凸二次规划问题凸二次规划更多>>
相关领域:理学建筑科学经济管理更多>>
-

检索结果分析

结果分析中...
条 记 录,以下是1-10
视图:
排序:
可达到和可逼近总极小点的存在性和最优性(英文)
《运筹学学报》2012年第2期32-40,共9页姚奕荣 安柳 陈熙 郑权 
Supported by the grant of National Natural Science Foundation of China(No.10771133);Key Disciplines of Shanghai Municipality(Operations Research and Control Theory S 30104)
针对积分总极值,讨论并拓展了丰满集和丰满函数的概念,研究了拟上丰满和伪上丰满函数的总极值问题.在总极值的变差积分最优性条件下,证明了拟上丰满函数的可达到极小点和伪上丰满函数的可逼近极小点的存在性.
关键词:总极值问题 丰满极小点 拟上半丰满 变差积分 
总极值问题的几种变差积分算法的实现比较
《上海大学学报(自然科学版)》2012年第1期54-58,共5页王筱莉 梁泽亮 姚奕荣 郑权 
国家自然科学基金资助项目(10771133);上海市重点学科建设资助项目(S30104;J50101)
构造3种类型的变差积分,并运用它们来研究和求解总极值问题.针对不同的变差积分算法,结合Monte-Carlo技术,分别对100个变量的具体实例进行算法实现.数值试验结果表明,所设计的变差积分算法对不同的目标函数都有优势。
关键词:总极值问题 最优性条件 变差积分 MONTE-CARLO方法 
Approximation algorithms for indefinite complex quadratic maximization problems被引量:3
《Science China Mathematics》2010年第10期2697-2708,共12页HUANG Yongwei1,& ZHANG Shuzhong2 1Department of Electronic and Computer Engineering,The Hong Kong University of Science and Technology,Kowloon,Hong Kong,China 2Department of Systems Engineering and Engineering Management,The Chinese University of Hong Kong,Shatin,Hong Kong,China 
supported by Hong Kong RGC Earmarked Grant (Grant No.CUHK418406);National Natural Science Foundation of China (Grant No.10771133)
In this paper,we consider the following indefinite complex quadratic maximization problem: maximize zHQz,subject to zk ∈ C and zkm = 1,k = 1,...,n,where Q is a Hermitian matrix with trQ = 0,z ∈ Cn is the decision ve...
关键词:INDEFINITE HERMITIAN matrix RANDOMIZED algorithms approximation ratio SEMIDEFINITE programming relaxation 
求解凸二次规划问题的一种加权路径跟踪内点算法被引量:5
《运筹学学报》2010年第1期55-65,共11页金正静 白延琴 韩伯顺 
国家自然科学基金(No.10771133)资助;教育部博士点基金资助(No.200802800010);上海市重点学科资助(No.S30104);浙江林学院科研项目(No.2009FR044;No.2451008040)资助
基于Darvay提出用加权路径跟踪内点算法解线性规划问题的相关工作,本文致力于将此算法推广于解凸二次规划问题,并证明此算法具有局部二次收敛速度和目前所知的最好的多项式时间算法复杂性.
关键词:运筹学 凸二次规划 小步校正算法 纯Newton步 加权路径跟踪内点算法 多项式时间算法复杂性 
Reduction of truss topology optimization
《Journal of Shanghai University(English Edition)》2009年第6期489-496,共8页孙艳 白延琴 周轶凯 
Project supported by the National Natural Science Foundation of China (Grant No.10771133);the Research Fundation for the Doctoral Program of Higher Education (Grant No.200802800010);the Key Disciplines of Shanghai Municipality (GrantNo.s30104)
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...
关键词:truss topology optimization REDUCTION semidefinite optimization (SDO) group representation theory 
General space-efficient sampling algorithm for suboptimal alignment
《Journal of Shanghai University(English Edition)》2009年第5期412-416,共5页陈燚 白延琴 
supported by the National Natural Science Foundation of China (Grant No.10771133)
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 ...
关键词:suboptimal alignment sampling dynamic programming biological sequence comparison 
Discontinuous penalty approach with deviation integral for global constrained minimization被引量:1
《Applied Mathematics and Mechanics(English Edition)》2009年第9期1201-1210,共10页陈柳 姚奕荣 郑权 
supported by the National Natural Science Foundation of China (No. 10771133);the KeyDisciplines of Shanghai Municipality (Operations Research and Cybernetics) (No. S30104)
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 analyti...
关键词:global optimization constrained problems deviation integral cross-entropy method 
变差积分型约束总极值问题的不连续罚途径被引量:3
《应用数学和力学》2009年第9期1125-1134,共10页陈柳 姚奕荣 郑权 
国家自然科学基金资助项目(10771133);上海市重点学科(运筹学与控制论)建设资助项目(S30104)
结合积分途径运用不连续精确罚函数来求解全局约束最小化问题.进一步,提出了约束变差积分的一般形式并证明了其分析性质,同时也给出并证明了其全局最优性条件,并由此设计了一个新算法.基于Monte-Carlo模拟技术,运用交叉熵方法和重要样...
关键词:全局优化 约束问题 变差积分 交叉熵方法 
Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
《Journal of Shanghai University(English Edition)》2009年第4期333-339,共7页金正静 白延琴 
supported by the National Natural Science Foundation of China (Grant No.10771133);the Shanghai Leading Academic Discipline Project (Grant No.S30101);the Research Foundation for the Doctoral Program of Higher Education (Grant No.200802800010)
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 opt...
关键词:linear optimization self-concordant function finite barrier interior-point methods polynomial-time complexity 
Penalized interior point approach for constrained nonlinear programming被引量:1
《Journal of Shanghai University(English Edition)》2009年第3期248-254,共7页陆文婷 姚奕荣 张连生 
supported by the National Natural Science Foundation of China (Grant No.10771133);the Shanghai Leading Academic Discipline Project (Grant Nos.J50101, S30104)
A penalized interior point approach for constrained nonlinear programming is examined in this work. To overcome the difficulty of initialization for the interior point method, a problem equivalent to the primal proble...
关键词:nonlinear programming interior point method barrier penalty function global convergence 
检索报告 对象比较 聚类工具 使用帮助 返回顶部