Optimization Strategies in Complex Systems
Numerical Analysis
2025-10-20 v1 Numerical Analysis
Mathematical Physics
math.MP
Abstract
We consider a class of combinatorial optimization problems that emerge in a variety of domains among which: condensed matter physics, theory of financial risks, error correcting codes in information transmissions, molecular and protein conformation, image restoration. We show the performances of two algorithms, the``greedy'' (quick decrease along the gradient) and the``reluctant'' (slow decrease close to the level curves) as well as those of a``stochastic convex interpolation''of the two. Concepts like the average relaxation time and the wideness of the attraction basin are analyzed and their system size dependence illustrated.
Cite
@article{arxiv.math/0309058,
title = {Optimization Strategies in Complex Systems},
author = {L. Bussolari and P. Contucci and C. Giardina' and C. Giberti and F. Unguendoli and C. Vernia},
journal= {arXiv preprint arXiv:math/0309058},
year = {2025}
}
Comments
8 pages, 3 figures