Searching with iterated maps

被引：132

作者：

Elser, V. ^{[1
]}

Rankenburg, I. ^{[1
]}

Thibault, P. ^{[1
]}

机构：

[1] Cornell Univ, Dept Phys, Ithaca, NY 14853 USA

来源：

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA | 2007年 / 104卷 / 02期

关键词：

combinatorial search; global optimization; phase retrieval; protein folding; dynamical systems;

D O I：

10.1073/pnas.0606359104

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

In many problems that require extensive searching, the solution can be described as satisfying two competing constraints, where satisfying each independently does not pose a challenge. As an alternative to tree-based and stochastic searching, for these problems we propose using an iterated map built from the projections to the two constraint sets. Algorithms of this kind have been the method of choice in a large variety of signal-processing applications; we show here that the scope of these algorithms is surprisingly broad, with applications as diverse as protein folding and Sucloku.

引用

页码：418 / 423

页数：6

共 25 条

[1]

[Anonymous], P AAAI 97

[2] Finding best approximation pairs relative to two closed convex sets in Hilbert spaces [J].