Simulated annealing in convex bodies and an O∗(n4) volume algorithm

L. Lovász, S. Vempala

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Abstract

We present a new algorithm for computing the volume of a convex body in ℝn. The main ingredient of the algorithm is a "morphing" technique that can be viewed as a variant of simulated annealing. Its complexity is O∗(n4), improving on the previous best algorithm by a factor of n.

Original languageEnglish
Title of host publicationProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
PublisherIEEE Computer Society
Pages650-659
Number of pages10
Volume2003-January
ISBN (Print)0769520405
DOIs
Publication statusPublished - 2003
Event44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003 - Cambridge, United States
Duration: Oct 11 2003Oct 14 2003

Other

Other44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003
CountryUnited States
CityCambridge
Period10/11/0310/14/03

Fingerprint

Simulated annealing

Keywords

  • Artificial intelligence
  • Computational modeling
  • Engineering profession
  • Mathematics
  • Optimization methods
  • Polynomials
  • Search methods
  • Simulated annealing
  • Space stations
  • Temperature distribution

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Lovász, L., & Vempala, S. (2003). Simulated annealing in convex bodies and an O∗(n4) volume algorithm. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS (Vol. 2003-January, pp. 650-659). [1238237] IEEE Computer Society. https://doi.org/10.1109/SFCS.2003.1238237

Simulated annealing in convex bodies and an O∗(n4) volume algorithm. / Lovász, L.; Vempala, S.

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. Vol. 2003-January IEEE Computer Society, 2003. p. 650-659 1238237.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lovász, L & Vempala, S 2003, Simulated annealing in convex bodies and an O∗(n4) volume algorithm. in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. vol. 2003-January, 1238237, IEEE Computer Society, pp. 650-659, 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, Cambridge, United States, 10/11/03. https://doi.org/10.1109/SFCS.2003.1238237
Lovász L, Vempala S. Simulated annealing in convex bodies and an O∗(n4) volume algorithm. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. Vol. 2003-January. IEEE Computer Society. 2003. p. 650-659. 1238237 https://doi.org/10.1109/SFCS.2003.1238237
Lovász, L. ; Vempala, S. / Simulated annealing in convex bodies and an O∗(n4) volume algorithm. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. Vol. 2003-January IEEE Computer Society, 2003. pp. 650-659
@inproceedings{9f59a60ddd874014828bbdf01505ef8b,
title = "Simulated annealing in convex bodies and an O∗(n4) volume algorithm",
abstract = "We present a new algorithm for computing the volume of a convex body in ℝn. The main ingredient of the algorithm is a {"}morphing{"} technique that can be viewed as a variant of simulated annealing. Its complexity is O∗(n4), improving on the previous best algorithm by a factor of n.",
keywords = "Artificial intelligence, Computational modeling, Engineering profession, Mathematics, Optimization methods, Polynomials, Search methods, Simulated annealing, Space stations, Temperature distribution",
author = "L. Lov{\'a}sz and S. Vempala",
year = "2003",
doi = "10.1109/SFCS.2003.1238237",
language = "English",
isbn = "0769520405",
volume = "2003-January",
pages = "650--659",
booktitle = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Simulated annealing in convex bodies and an O∗(n4) volume algorithm

AU - Lovász, L.

AU - Vempala, S.

PY - 2003

Y1 - 2003

N2 - We present a new algorithm for computing the volume of a convex body in ℝn. The main ingredient of the algorithm is a "morphing" technique that can be viewed as a variant of simulated annealing. Its complexity is O∗(n4), improving on the previous best algorithm by a factor of n.

AB - We present a new algorithm for computing the volume of a convex body in ℝn. The main ingredient of the algorithm is a "morphing" technique that can be viewed as a variant of simulated annealing. Its complexity is O∗(n4), improving on the previous best algorithm by a factor of n.

KW - Artificial intelligence

KW - Computational modeling

KW - Engineering profession

KW - Mathematics

KW - Optimization methods

KW - Polynomials

KW - Search methods

KW - Simulated annealing

KW - Space stations

KW - Temperature distribution

UR - http://www.scopus.com/inward/record.url?scp=84929354108&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84929354108&partnerID=8YFLogxK

U2 - 10.1109/SFCS.2003.1238237

DO - 10.1109/SFCS.2003.1238237

M3 - Conference contribution

SN - 0769520405

VL - 2003-January

SP - 650

EP - 659

BT - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

PB - IEEE Computer Society

ER -