中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
机构
采集方式
内容类型
发表日期
学科主题
筛选

浏览/检索结果: 共7条,第1-7条 帮助

条数/页: 排序方式:
A new fully polynomial time approximation scheme for the interval subset sum problem 期刊论文  OAI收割
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 卷号: 68, 期号: 4, 页码: 749-775
作者:  
Diao, Rui;  Liu, Ya-Feng;  Dai, Yu-Hong
  |  收藏  |  浏览/下载:28/0  |  提交时间:2018/07/30
Nonlinear Stepsize Control Algorithms: Complexity Bounds for First- and Second-Order Optimality 期刊论文  OAI收割
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2016, 卷号: 171, 期号: 3, 页码: 980-997
作者:  
Grapiglia, Geovani Nunes;  Yuan, Jinyun;  Yuan, Ya-xiang
  |  收藏  |  浏览/下载:19/0  |  提交时间:2018/07/30
A smoothing SQP framework for a class of composite minimization over polyhedron 期刊论文  OAI收割
MATHEMATICAL PROGRAMMING, 2016, 卷号: 158, 期号: 1-2, 页码: 467-500
作者:  
Liu, Ya-Feng;  Ma, Shiqian;  Dai, Yu-Hong;  Zhang, Shuzhong
  |  收藏  |  浏览/下载:47/0  |  提交时间:2018/07/30
A derivative-free trust-region algorithm for composite nonsmooth optimization 期刊论文  OAI收割
COMPUTATIONAL & APPLIED MATHEMATICS, 2016, 卷号: 35, 期号: 2, 页码: 475-499
作者:  
Grapiglia, Geovani Nunes;  Yuan, Jinyun;  Yuan, Ya-xiang
  |  收藏  |  浏览/下载:21/0  |  提交时间:2018/07/30
On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization 期刊论文  OAI收割
OPTIMIZATION METHODS & SOFTWARE, 2016, 卷号: 31, 期号: 3, 页码: 591-604
作者:  
Grapiglia, G. N.;  Yuan, J.;  Yuan, Y.
  |  收藏  |  浏览/下载:24/0  |  提交时间:2018/07/30
On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization 期刊论文  OAI收割
MATHEMATICAL PROGRAMMING, 2015, 卷号: 152, 期号: 1-2, 页码: 491-520
作者:  
Grapiglia, Geovani N.;  Yuan, Jinyun;  Yuan, Ya-xiang
  |  收藏  |  浏览/下载:22/0  |  提交时间:2018/07/30
The worst case complexity of the Fredholm equation with periodic free term and noisy information 期刊论文  OAI收割
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1999, 卷号: 73, 期号: 1, 页码: 1-14
作者:  
Jiang, TZ;  Evans, DJ
收藏  |  浏览/下载:21/0  |  提交时间:2015/11/08