In recent years there has been significant interest in adapting tech-niques from statistical physics, in particular mean field theory, to pro-vide deterministic heuristic algorithms for obtaining approximate solu-tions to optimization problems. Although these algorithms have been shown experimentally to be successful there has been little theoretical analysis of them. In this paper we demonstrate connections between mean field theory methods and other approaches, in particular, barrier function and interior point methods. As an explicit example, we sum-marize our work on the linear assignment problem. In this previous work we defined a number of algorithms, including deterministic an-nealing, for solving the assignment problem. We proved co...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
The assumption that the elements of the cost matrix in the classical assignment problem are drawn in...
In this paper we provide a rigorous convergence analysis for the renowned particle swarm optimizatio...
We show that there are strong relationships between approaches to optmization and learning based on ...
The technique of optimization transfer has surfaced from time to time in the statistical literature ...
Many physicists are not aware of the fact that they can solve their problems by applying optimizatio...
The scope of these lecture notes is to provide an introduction to modern statistical physics mean-fi...
For combinatorial optimization problems that can be formulated as Ising or Potts spin systems, the M...
A brief review is given for the use of feed-back artificial neural networks (ANN) to obtain good app...
Several optimization problems can be stated as disordered systems problems. This fact encouraged a f...
AbstractRecently, it has been recognized that phase transitions play an important role in the probab...
A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimizat...
The interplay between optimization and machine learning is one of the most important developments in...
A mean-field theory for optimization problems of the Travelling Salesman type, or of the Matching ty...
Abstract. The combinatorial problem of satisfying a given set of constraints that depend on N discre...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
The assumption that the elements of the cost matrix in the classical assignment problem are drawn in...
In this paper we provide a rigorous convergence analysis for the renowned particle swarm optimizatio...
We show that there are strong relationships between approaches to optmization and learning based on ...
The technique of optimization transfer has surfaced from time to time in the statistical literature ...
Many physicists are not aware of the fact that they can solve their problems by applying optimizatio...
The scope of these lecture notes is to provide an introduction to modern statistical physics mean-fi...
For combinatorial optimization problems that can be formulated as Ising or Potts spin systems, the M...
A brief review is given for the use of feed-back artificial neural networks (ANN) to obtain good app...
Several optimization problems can be stated as disordered systems problems. This fact encouraged a f...
AbstractRecently, it has been recognized that phase transitions play an important role in the probab...
A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimizat...
The interplay between optimization and machine learning is one of the most important developments in...
A mean-field theory for optimization problems of the Travelling Salesman type, or of the Matching ty...
Abstract. The combinatorial problem of satisfying a given set of constraints that depend on N discre...
Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground i...
The assumption that the elements of the cost matrix in the classical assignment problem are drawn in...
In this paper we provide a rigorous convergence analysis for the renowned particle swarm optimizatio...