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

被引：122

作者：

Lovász, L

Vempala, S

机构：

[1] MIT, Dept Math, Cambridge, MA 02139 USA

[2] Microsoft Res, Redmond, WA 98052 USA

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2006年 / 72卷 / 02期

基金：

美国国家科学基金会;

关键词：

convex bodies; volume computation; random walks; simulated annealing; logconcave functions;

D O I：

10.1016/j.jcss.2005.08.004

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present a new algorithm for computing the volume of a convex body in R-n. The main ingredients of the algorithm are (i) a "morphing" technique that can be viewed as a variant of simulated annealing and (ii) a new rounding algorithm to put a convex body in near-isotropic position. The complexity is O*(n(4)), improving on the previous best algorithm by a factor of n. (c) 2005 Elsevier Inc. All rights reserved.

引用

页码：392 / 417

页数：26

共 50 条

[21] THE APPLICATION OF THE SIMULATED ANNEALING ALGORITHM TO THE SOLUTION OF THE N/M/CMAX FLOWSHOP PROBLEM
OGBU, FA
SMITH, DK
COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (03) : 243 - 253
[22] Ab initio Monte Carlo simulated annealing study of HCl(H2O)n (n=3, 4) clusters
Bacelo, DE
Binning, RC
Ishikawa, Y
JOURNAL OF PHYSICAL CHEMISTRY A, 1999, 103 (24): : 4631 - 4640
[23] A Construction of Real-Time Sequence Generation Algorithm for {n4|n=1, 2, 3, ... }
Kamikawa, Naoki
Umeo, Hiroshi
2019 SEVENTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING WORKSHOPS (CANDARW 2019), 2019, : 215 - 220
[24] A NEW O(N.LOG-N) ALGORITHM FOR COMPUTING THE INTERSECTION OF CONVEX POLYGONS
KUNDU, S
PATTERN RECOGNITION, 1987, 20 (04) : 419 - 424
[25] From N2 and O2 to N4 and O4:: Pneumatic chemistry in the 21st century
Cacace, F
CHEMISTRY-A EUROPEAN JOURNAL, 2002, 8 (17) : 3839 - 3847
[26] Computing a minimum-depth planar graph embedding in O(n4) time
Angelini, Patrizio
Di Battista, Giuseppe
Patrignani, Maurizio
ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 287 - +
[27] Service Deployment of C4ISR Based on Genetic Simulated Annealing Algorithm
Jiao, Zhiqiang
Zhang, Jieyong
Yao, Peiyang
Wan, Lujun
Ni, Lei
IEEE ACCESS, 2020, 8 : 65498 - 65512
[28] ACTIVATION OF DIOXYGEN BY COORDINATION - REACTIONS OF CO(N4)O2 ADDUCTS
ENDICOTT, JF
BALAKIRSHNAN, KP
WONG, CL
ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1980, 180 (AUG): : 319 - INOR
[29] Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time
Patrizio Angelini
Giuseppe Di Battista
Maurizio Patrignani
Algorithmica, 2011, 60 : 890 - 937
[30] O(N) ALGORITHM FOR DISCRETE N-POINT CONVEX APPROXIMATION WITH APPLICATIONS TO CONTINUOUS CASE
UBHAYA, VA
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1979, 72 (01) : 338 - 354

← 1 2 3 4 5 →