咨询与建议

限定检索结果

文献类型

  • 30 篇 期刊文献
  • 4 篇 会议

馆藏范围

  • 34 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 24 篇 工学
    • 10 篇 控制科学与工程
    • 9 篇 计算机科学与技术...
    • 5 篇 电气工程
    • 4 篇 软件工程
    • 2 篇 电子科学与技术(可...
    • 2 篇 信息与通信工程
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 动力工程及工程热...
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
  • 18 篇 理学
    • 18 篇 数学
    • 1 篇 系统科学
    • 1 篇 统计学(可授理学、...
  • 18 篇 管理学
    • 18 篇 管理科学与工程(可...
    • 1 篇 公共管理
  • 2 篇 经济学
    • 1 篇 理论经济学
    • 1 篇 应用经济学
  • 1 篇 法学
    • 1 篇 社会学

主题

  • 34 篇 ellipsoid algori...
  • 5 篇 linear programmi...
  • 4 篇 computational co...
  • 4 篇 nonlinear progra...
  • 3 篇 linear inequalit...
  • 3 篇 convex programmi...
  • 3 篇 lmi
  • 3 篇 convex optimizat...
  • 2 篇 cutting plane me...
  • 2 篇 computational ex...
  • 2 篇 interior-point m...
  • 2 篇 nonlinear optimi...
  • 2 篇 linear matrix in...
  • 2 篇 algorithm evalua...
  • 2 篇 ewma
  • 2 篇 equality constra...
  • 2 篇 tracking error
  • 2 篇 geometric progra...
  • 2 篇 robustness
  • 2 篇 portfolio select...

机构

  • 1 篇 cornell univ ith...
  • 1 篇 tel aviv univers...
  • 1 篇 hebrew univ jeru...
  • 1 篇 heinz nixdorf in...
  • 1 篇 politecn torino ...
  • 1 篇 department of co...
  • 1 篇 qingdao campus n...
  • 1 篇 bell laboratorie...
  • 1 篇 department of ma...
  • 1 篇 rensselaer polyt...
  • 1 篇 european institu...
  • 1 篇 nankai univ coll...
  • 1 篇 eecs mit
  • 1 篇 cornell univ sch...
  • 1 篇 rensselaer polyt...
  • 1 篇 univ waterloo de...
  • 1 篇 department of ma...
  • 1 篇 delft univ techn...
  • 1 篇 mit dept elect e...
  • 1 篇 korea adv inst s...

作者

  • 5 篇 kupferschmid m
  • 3 篇 ecker jg
  • 2 篇 jin chu-xin
  • 2 篇 chen wan-yi
  • 2 篇 freund robert m.
  • 2 篇 baang dane
  • 2 篇 yu shu-jing
  • 1 篇 kim s
  • 1 篇 yang cai
  • 1 篇 zhang s
  • 1 篇 recht p.
  • 1 篇 de sterck hans
  • 1 篇 todd mj
  • 1 篇 kanev s
  • 1 篇 goldfarb d
  • 1 篇 haim kaplan
  • 1 篇 calafiore giusep...
  • 1 篇 safonov mg
  • 1 篇 sanders geoffrey
  • 1 篇 miller killian

语言

  • 32 篇 英文
  • 2 篇 其他
检索条件"主题词=ellipsoid algorithm"
34 条 记 录,以下是31-40 订阅
排序:
Robust Portfolio Selection Based on Optimization Methods
Robust Portfolio Selection Based on Optimization Methods
收藏 引用
37th Chinese Control Conference (CCC)
作者: Jin Chu-xin Chen Wan-yi Yu Shu-jing Nankai Univ Coll Comp & Control Engn Tianjin 300350 Peoples R China Qingdao Campus Naval Aeronaut Univ Qingdao 266041 Shandong Peoples R China
Linear matrix inequalities (LMI) are used to solve robust portfolio problems and many other control problems. ellipsoid algorithm and interior-point method are used to solve EAU. In this paper, we consider a robust po... 详细信息
来源: 评论
Optimal oblivious routing in polynomial time  03
Optimal oblivious routing in polynomial time
收藏 引用
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
作者: Yossi Azar Edith Cohen Amos Fiat Haim Kaplan Harald Racke Tel Aviv University Tel Aviv Israel AT&T research labs Florham park NJ Heinz Nixdorf Institute and Paderborn University Paderborn Germany
A recent seminal result of Racke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Racke's construction is not polynomial t... 详细信息
来源: 评论
Reducing Revenue to Welfare Maximization: Approximation algorithms and other Generalizations  13
Reducing Revenue to Welfare Maximization: Approximation Algo...
收藏 引用
Symposium on Discrete algorithms
作者: Yang Cai Constantinos Daskalakis S. Matthew Weinberg EECS MIT
It was recently shown in [12] that revenue optimization can be computationally efficiently reduced to welfare optimization in all multi-dimensional Bayesian auction problems with arbitrary (possibly combinatorial) fea... 详细信息
来源: 评论
Robust Portfolio Selection Based on Optimization Methods
Robust Portfolio Selection Based on Optimization Methods
收藏 引用
第37届中国控制会议
作者: JIN Chu-xin CHEN Wan-yi YU Shu-jing College of Computer and Control Engineering Nankai University Qingdao Campus of Naval Aeronautical University
Linear matrix inequalities(LMI) are used to solve robust portfolio problems and many other control problems. ellipsoid algorithm and interior-point method are used to solve LMI. In this paper, we consider a robust p... 详细信息
来源: 评论