The DOI matches its Crossref record.
Simulated Annealing for Convex Optimization
Abstract
We apply the method known as simulated annealing to the following problem in convex optimization: Minimize a linear function over an arbitrary convex set, where the convex set is specified only by a membership oracle. Using distributions from the Boltzmann-Gibbs family leads to an algorithm that needs only O*(√n) phases for instances in ℝ n. This gives an optimization algorithm that makes O*(n 4.5) calls to the membership oracle, in the worst case, compared to the previous best guarantee of O*(n 5). The benefits of using annealing here are surprising because such problems have no local minima that are not also global minima. Hence, we conclude that one of the advantages of simulated annealing, in addition to avoiding poor local minima, is that in these problems it converges faster to the minima that it finds. We also give a proof that under certain general conditions, the Boltzmann-Gibbs distributions are optimal for annealing on these convex problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Autonomous Task Planning Method for Multi-Satellite System Based on a Hybrid Genetic Algorithm
Long, J., Wu, S., Han, X., Wang, Y., & Liu, L. (2023) · Aerospace · doi:10.3390/aerospace10010070 · Cited by 39
Metadata
- Authors
- Kalai, A. T., & Vempala, S.
- Venue
- Mathematics of Operations Research
- Published
- 2006-05
- Volume
- 31
- Issue
- 2
- Pages
- 253-266
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2168908795
- Cited by
- 158
- References
- 0
- FWCI
- 8.29
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Simulated Annealing for Convex Optimization. https://app.cochat.ai/papers/10.1287/moor.1060.0194
- The paper
- Kalai, A. T., & Vempala, S. (2006). Simulated Annealing for Convex Optimization. Mathematics of Operations Research. https://doi.org/10.1287/moor.1060.0194
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.