00000cab a22000003a 4500 UP-99796217608727343 Buklod 20231007234725.0 m |o d | ta 090225s xx d | ||r ||||| || DENGII eng Bertsimas, D. Solving convex programs by random walks. pp. 540-556 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. Theory of computation. Analysis of algorithms and problem complexity. Mathematics of computing. Probability and statistics. Stochastic processes. Algorithms. Theory. Journal of the ACM 51, 4 (2004). FO UPD DENG-II Article