中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页
机构
成果
学者
登录
注册
登陆
×
验证码:
换一张
忘记密码?
记住我
×
校外用户登录
CAS IR Grid
机构
数学与系统科学研究院 [3]
科技战略咨询研究院 [1]
采集方式
OAI收割 [4]
内容类型
期刊论文 [4]
发表日期
2007 [1]
2000 [1]
1999 [2]
学科主题
Applied [1]
Mathematic... [1]
筛选
浏览/检索结果:
共4条,第1-4条
帮助
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
题名升序
题名降序
提交时间升序
提交时间降序
作者升序
作者降序
发表日期升序
发表日期降序
Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
期刊论文
OAI收割
APPLIED NUMERICAL MATHEMATICS, 2007, 卷号: 57, 期号: 9, 页码: 1033-1049
作者:
Zhao, Y. B.
  |  
收藏
  |  
浏览/下载:24/0
  |  
提交时间:2018/07/30
linear programming
interior-point algorithms
iteration complexity
neighborhoods
Average number of iterations of some polynomial interior-point - Algorithms for linear programming
期刊论文
OAI收割
SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY, 2000, 卷号: 43, 期号: 8, 页码: 7,829-835
作者:
Huang, SM
  |  
收藏
  |  
浏览/下载:12/0
  |  
提交时间:2012/11/12
Linear Programming
Interior Point Algorithms
Probabilistic Lp Models
Average Number Of Iterations
Two interior-point methods for nonlinear P-*(tau)-complementarity problems
期刊论文
OAI收割
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1999, 卷号: 102, 期号: 3, 页码: 659-679
作者:
Zhao, YB
  |  
收藏
  |  
浏览/下载:11/0
  |  
提交时间:2018/07/30
interior-point algorithms
nonlinear P-*-complementarity problems
polynomial complexity
scaled Lipschitz condition
On quadratic convergence of the O(root nL)-iteration homogeneous and self-dual linear programming algorithm
期刊论文
OAI收割
ANNALS OF OPERATIONS RESEARCH, 1999, 卷号: 87, 页码: 393-406
作者:
Wu, F
;
Wu, SQ
;
Ye, YY
  |  
收藏
  |  
浏览/下载:27/0
  |  
提交时间:2018/07/30
linear programming
interior-point algorithms
homogeneity
self-dual
quadratic convergence