Simulated Annealing for Convex Optimization
- 1 May 2006
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 31 (2) , 253-266
- https://doi.org/10.1287/moor.1060.0194
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Solving convex programs by random walksJournal of the ACM, 2004
- Elements of Information TheoryPublished by Wiley ,2001
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entriesPublished by Association for Computing Machinery (ACM) ,2001
- Random walks and anO*(n5) volume algorithm for convex bodiesRandom Structures & Algorithms, 1997
- Sampling from Log-Concave DistributionsThe Annals of Applied Probability, 1994
- Adaptive Rejection Sampling for Gibbs SamplingJournal of the Royal Statistical Society Series C: Applied Statistics, 1992
- Sampling and integration of near log-concave functionsPublished by Association for Computing Machinery (ACM) ,1991
- Cooling Schedules for Optimal AnnealingMathematics of Operations Research, 1988
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- Über eine Klasse superadditiver Mengenfunktionale von Brunn-Minkowski-Lusternikschem TypusMathematische Zeitschrift, 1957