Discussion on: "Why Is Resorting to Fate Wise? A Critical Look at Randomized Algorithms in Systems and Control"

被引：0
作者：
Mitter, Sanjoy K. [1 ]
机构：
[1] MIT, Cambridge, MA 02139 USA
来源：
EUROPEAN JOURNAL OF CONTROL | 2010年 / 16卷 / 05期
关键词：
Compendex;
D O I：
10.1016/S0947-3580(10)70675-0
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
[No abstract available]
引用
收藏
页码：431 / 432
页数：2
相关论文
共 9 条
[1]   A SUBLINEAR-TIME RANDOMIZED APPROXIMATION ALGORITHM FOR MATRIX GAMES [J].
GRIGORIADIS, MD ;
KHACHIYAN, LG .
OPERATIONS RESEARCH LETTERS, 1995, 18 (02) :53-58
[2]  
JUDISTKY A, SOLVING VARIATIONAL
[3]   Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems [J].
Nemirovski, A .
SIAM JOURNAL ON OPTIMIZATION, 2004, 15 (01) :229-251
[4]   ROBUST STOCHASTIC APPROXIMATION APPROACH TO STOCHASTIC PROGRAMMING [J].
Nemirovski, A. ;
Juditsky, A. ;
Lan, G. ;
Shapiro, A. .
SIAM JOURNAL ON OPTIMIZATION, 2009, 19 (04) :1574-1609
[5]  
Nemirovski A. S., 1983, PROBLEM COMPLEXITY M
[6]   Smooth minimization of non-smooth functions [J].
Nesterov, Y .
MATHEMATICAL PROGRAMMING, 2005, 103 (01) :127-152
[7]  
RASTRIGIN LA, 1965, RANDOM SEARCH OPTIMI
[8]   A STOCHASTIC APPROXIMATION METHOD [J].
ROBBINS, H ;
MONRO, S .
ANNALS OF MATHEMATICAL STATISTICS, 1951, 22 (03) :400-407
[9]  
WIDGERSON A, 2007, P INT C MATH MADR AU, V1
1