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

来源：

JOURNAL OF THE ACM | 2004年 / 51卷 / 04期

关键词：

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 条

[41] Random walks and an O*(n(5)) volume algorithm for convex bodies
Kannan, R
Lovasz, L
Simonovits, M
RANDOM STRUCTURES & ALGORITHMS, 1997, 11 (01) : 1 - 50
[42] Random Convex Approximations of Ambiguous Chance Constrained Programs
Tseng, Shih-Hao
Bitar, Eilyan
Tang, Ao
2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 6210 - 6215
[43] Random walks for solving boundary-value problems with flux conditions
Simonov, Nikolai A.
NUMERICAL METHODS AND APPLICATIONS, 2007, 4310 : 181 - 188
[44] SOLVING QUADRATIC MATRIX EQUATIONS ARISING IN RANDOM WALKS IN THE QUARTER PLANE
Bini, Dario A.
Meini, Beatrice
Meng, Jie
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2020, 41 (02) : 691 - 714
[45] Solving the accuracy-diversity dilemma via directed random walks
Liu, Jian-Guo
Shi, Kerui
Guo, Qiang
PHYSICAL REVIEW E, 2012, 85 (01):
[46] AN OUTER APPROXIMATION ALGORITHM FOR SOLVING GENERAL CONVEX-PROGRAMS
FUKUSHIMA, M
OPERATIONS RESEARCH, 1983, 31 (01) : 101 - 113
[47] Multicoordination methods for solving convex block-angular programs
Meyer, RR
Zakeri, G
SIAM JOURNAL ON OPTIMIZATION, 1999, 10 (01) : 121 - 131
[48] Solving cone-constrained convex programs by differential inclusions
Flam, Sjur D.
Seeger, Alberto
Mathematical Programming, Series B, 1994, 65 (01): : 107 - 121
[49] Deviation estimates for random walks and stochastic methods for solving the Schrodinger equation
Chebotarev, AM
Polyakov, AV
MATHEMATICAL NOTES, 2004, 76 (3-4) : 564 - 577
[50] On solving difference of convex functions programs with linear complementarity constraints
Hoai An Le Thi
Thi Minh Tam Nguyen
Tao Pham Dinh
Computational Optimization and Applications, 2023, 86 : 163 - 197

← 1 2 3 4 5 →