A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
A randomized algorithm to optimize over certain convex sets
Mathematics of Operations Research
A new algorithm for minimizing convex functions over convex sets
Mathematical Programming: Series A and B
Random walks and an O*(n5) volume algorithm for convex bodies
Random Structures & Algorithms
Faster mixing via average conductance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Introduction to Linear Optimization
Introduction to Linear Optimization
Efficient algorithms for universal portfolios
The Journal of Machine Learning Research
A randomized polynomial-time simplex algorithm for linear programming
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Simulated annealing in convex bodies and an O*(n4) volume algorithm
Journal of Computer and System Sciences - Special issue on FOCS 2003
The geometry of logconcave functions and sampling algorithms
Random Structures & Algorithms
Simulated Annealing for Convex Optimization
Mathematics of Operations Research
Approximating the centroid is hard
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Sampling Hypersurfaces through Diffusion
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Multi-dimensional online tracking
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Cutting-set methods for robust convex optimization with pessimizing oracles
Optimization Methods & Software
Policy teaching through reward function learning
Proceedings of the 10th ACM conference on Electronic commerce
An Efficient Rescaled Perceptron Algorithm for Conic Systems
Mathematics of Operations Research
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A general approach to environment design with one agent
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An efficient re-scaled perceptron algorithm for conic systems
COLT'07 Proceedings of the 20th annual conference on Learning theory
Monotonicity in bargaining networks
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Thin partitions: isoperimetric inequalities and a sampling algorithm for star shaped bodies
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Classifier evasion: models and open problems
PSDML'10 Proceedings of the international ECML/PKDD conference on Privacy and security issues in data mining and machine learning
Strong NP-hardness of the quantum separability problem
Quantum Information & Computation
On the complexity of approximating the diamond norm
Quantum Information & Computation
Pattern discrete and mixed Hit-and-Run for global optimization
Journal of Global Optimization
Semantic communication for simple goals is equivalent to on-line learning
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
SIAM Journal on Optimization
Multidimensional online tracking
ACM Transactions on Algorithms (TALG)
Consistency of local density matrices is QMA-Complete
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Query strategies for evading convex-inducing classifiers
The Journal of Machine Learning Research
Lower bounds for hit-and-run direct search
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
On the complexity of model checking interval-valued discrete time Markov chains
Information Processing Letters
An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
Computational Optimization and Applications
| Hi-index | 0.01 |
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.