共 50 条
Solving convex programs by random walks
被引:127
作者:
Bertsimas, D
Vempala, S
机构:
[1] MIT, Sloan Sch Management, Cambridge, MA 02139 USA
[2] MIT, Ctr Operat Res, Cambridge, MA 02139 USA
[3] MIT, Dept Math, Cambridge, MA 02139 USA
关键词:
convex programs;
random walks;
polynomial time;
algorithms;
theory;
D O I:
10.1145/1008731.1008733
中图分类号:
TP3 [计算技术、计算机技术];
学科分类号:
0812 ;
摘要:
Minimizing a convex function over a convex set in n-dimensional space is a basic, general problem with many interesting special cases. Here, we present a simple new algorithm for convex optimization based on sampling by a random walk. It extends naturally to minimizing quasi-convex functions and to other generalizations.
引用
收藏
页码:540 / 556
页数:17
相关论文
共 50 条