云南高校图书馆联盟文献共享服务平台- 国家自然科学基金(11331012)

国家自然科学基金(11331012): 作品数：27被引量：70H指数：5; 导出分析报告; 相关作者：郭田德韩丛英高随祥杨文国刘明明更多>>; 相关机构：中国科学院大学中国科学院中国科学院数学与系统科学研究院中国电子科技集团公司信息科学研究院更多>>; 相关期刊：《计算机仿真》《Science China Mathematics》《Acta Mathematicae Applicatae Sinica》《Communications in Computational Physics》更多>>; 相关主题：BARZILAIMINIMIZATIONAPPROXIMATIONCONVEXSPARSE更多>>; 相关领域：理学自动化与计算机技术更多>>

On the complexity of sequentially lifting cover inequalities for the knapsack polytope被引量：1: 《Science China Mathematics》2021年第1期211-220,共10页Wei-Kun Chen Yu-Hong Dai; supported by National Natural Science Foundation of China(Grant Nos.11631013 and 11331012);the National Basic Research Program of China(Grant No.2015CB856002);the Major Project to Promote Development of Big Data from National Development and Reform Commission(Grant No.2016-999999-65-01-000696-01)。; The well-known sequentially lifted cover inequality is widely employed in solving mixed integer programs.However,it is still an open question whether a sequentially lifted cover inequality can be computed in polynomia...; 关键词：integer programming sequentially lifted cover inequality COMPLEXITY lifting problem

优化算法的复杂度分析被引量：10: 《中国科学：数学》2020年第9期1271-1336,共66页王奇超文再文蓝光辉袁亚湘; 国家自然科学基金(批准号:11831002和11331012)资助项目。; 优化算法的收敛性分析是优化中很重要的一个领域,然而收敛性并不足以作为比较不同算法效率的标准,因此需要另外一套衡量优化问题难易程度以及优化算法效率高低的理论,这套理论被称为优化算法的复杂度分析理论.本文共分为5个部分.第1节...; 关键词：优化算法复杂度分析加速梯度法条件梯度法随机优化算法

基于机器学习的点集匹配算法被引量：3: 《中国科学院大学学报（中英文）》2020年第4期450-457,共8页唐思琦韩丛英郭田德; the Chinese National Natural Science Foundation(11731013,11331012,11571014)。; 点集匹配是计算机视觉和模式识别中的重要问题,在目标识别、医学图像配准、姿态估计等方面都得到广泛应用。提出基于机器学习的端对端模型——multi-pointer network(MPN)来解决点集匹配问题。该网络模型利用多标签分类的思想,改进point...; 关键词：多指向型网络点集匹配递归神经网络长短期记忆网络多标签分类

Metrically regular mappings and its application to convergence analysis of a confined Newton-type method for nonsmooth generalized equations被引量：1: 《Science China Mathematics》2020年第1期39-60,共22页Mohammed Harunor Rashid Ya-xiang Yuan; supported by CAS-President International Fellowship Initiative (PIFI), Chinese Academy of Sciences, Beijing, China;supported by National Natural Science Foundation of China (Grants Nos. 11688101 and 11331012); Notion of metrically regular property and certain types of point-based approximations are used for solving the nonsmooth generalized equation f(x)+F(x)?0,where X and Y are Banach spaces,and U is an open subset of X,f:...; 关键词：set-valued mappings generalized equations metrically regular mapping semilocal convergence point-based approximation

从数值最优化方法到学习最优化方法被引量：6: 《运筹学学报》2019年第4期1-12,共12页郭田德韩丛英; 国家自然科学基金重大项目(总项目批准号 No.11991020，课题批准号No.11991022);国家自然科学基金重点项目(Nos.11731013,11331012);国家自然科学基金面上项目(No.11571014); 传统最优化问题的求解方法主要是以梯度法为基础的数值最优化方法,它是解析与数值计算相结合的迭代求解方法,是一种基于固定模式的最优化方法.算法的迭代过程实质上是对迭代点进行非线性变换的过程,该非线性变换是通过一系列方向和步长...; 关键词：人工智能深度学习数值最优化方法学习最优化方法

A ROBUST INTERIOR POINT METHOD FOR COMPUTING THE ANALYTIC CENTER OF AN ILL-CONDITIONED POLYTOPE WITH ERRORS: 《Journal of Computational Mathematics》2019年第6期843-865,共23页Zhouhong Wang Yuhong Dai Fengmin Xu; The authors would like to thank two anonymous referees for their valuable comments and suggestions.The author Yu-hong Dai is supported by the Chinese Natural Science Foundation(Nos.11631013,71331001 and 11331012);the National 973 Program of China(No.2015CB856002);The author Fengmin Xu is supported by the Chinese NSF grants(Nos.11571271,11631013 and 11605139).; In this paper we propose an efficient and robust method for computing the analytic center of the polyhedral set P={x€R^n|Ax=b,x>0},where the matrix A€ Rm×n is ill-conditioned,and there are errors in A and b.Besides o...; 关键词：ANALYTIC center ILL-CONDITIONING Unboundedness PRIMAL-DUAL INTERIOR point algorithm Convergence Polynomial complexity

逐层数据再表达的前后端融合学习的理论及其模型和算法被引量：4: 《中国科学：信息科学》2019年第6期739-759,共21页郭田德韩丛英李明强; 国家自然科学基金(批准号:11331012,11731013,11571014)资助项目; 基于学习的两个主要研究内容,本文提出了学习的二元分层模式,给出了前端学习、后端学习、前后端组合学习和前后端融合学习的概念,构建了前后端融合学习的理论框架与最优化模型;针对前端学习,模拟大脑的分级工作机制,提出了数据与模型混...; 关键词：机器学习模式识别数据表达数据与模型混合驱动

Efficient projected gradient methods for cardinality constrained optimization被引量：2: 《Science China Mathematics》2019年第2期245-268,共24页Fengmin Xu Yuhong Dai Zhihu Zhao Zongben Xu; supported by National Natural Science Foundation of China (Grant Nos. 11571271,11631013,11331012 and 71331001);the National Science Fund for Distinguished Young Scholars (Grant No. 11125107);the National 973 Program of China (Grant Nos. 2015CB856002 and 2013CB329404); Sparse optimization has attracted increasing attention in numerous areas such as compressed sensing, financial optimization and image processing. In this paper, we first consider a special class of cardinality constra...; 关键词：SPARSE APPROXIMATION projected GRADIENT method global CONVERGENCE signal recovery index tracking

判断一个无向图是否连通图的方法（英文）被引量：4: 《中国科学院大学学报（中英文）》2018年第5期582-588,共7页谭屯子高随祥杨文国; Supported by the National 973 Plan project(2011CB706900);the National 863 Plan project(2011AA01A102);the NSFC(11331012,11571015);the "Strategic Priority Research Program" of Chinese Academy of Sciences(XDA06010302); 判断图的连通性质是一个经典的图论问题,也是应用图挖掘和图分解的重要子问题。除了图分解,图的连通性质也被运用于追踪疾病的传播、大型系统设计、社交网络分析和"Cayley图"的一些理论研究。首先综述几种重要的判断无向图是否是连通图...; 关键词：连通性广度优先搜索深度优先搜索指数和 LAPLACIAN矩阵逻辑和

A Gradient-Enhanced ℓ_(1)Approach for the Recovery of Sparse Trigonometric Polynomials: 《Communications in Computational Physics》2018年第6期286-308,共23页Zhiqiang Xu Tao Zhou; Zhiqiang Xuwas supported by NSFC grant(91630203,11422113,11331012,11688101);by National Basic Research Program of China(973 Program 2015CB856000);Tao Zhou was supported by the NSF of China(under grant numbers 11688101,91630312,91630203,11571351,and 11731006);the science challenge project(No.TZ2018001),NCMIS,and the youth innovation promotion association(CAS).; In this paper,we discuss a gradient-enhancedℓ_(1)approach for the recovery of sparse Fourier expansions.By gradient-enhanced approaches we mean that the directional derivatives along given vectors are utilized to impr...; 关键词：Gradient-enhancedℓ_(1)minimization compressed sensing sparse Fourier expansions restricted isometry property mutual incoherence

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

国家自然科学基金(11331012)

检索结果分析

下载全文

高级检索检索式检索

时间限定

期刊范围

学科限定全选

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

国家自然科学基金(11331012)

检索结果分析

下载全文

用户登录

高级检索检索式检索