相关论文: Simulated Annealing for Topological Solitons
We use a simulated annealing algorithm to find the static field configuration with the lowest energy in a given sector of topological charge for generalized SU(2) Skyrme models. These numerical results suggest that the following conjecture…
We adapt the simulated annealing algorithm to the search of periodic orbits for classical multi-electron atomic systems. This is done by minimizing the n-th return distance to the initial position on a Poincare surface of section under an…
Incorporating the concept of order parameter of the mean-field theory into the simulated annealing method, we presented a new optimization algorithm, the guided simulated annealing method. In this method mean-field order parameters are…
Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Simulated annealing is a computational technique which explores the configuration space by…
Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a…
As one of the most robust global optimization methods, simulated annealing has received considerable attention, with many variations that attempt to improve the cooling schedule. This paper introduces a variant of simulated annealing that…
We construct the first analytic examples of topologically non-trivial solutions of the (3+1)-dimensional $U(1)$ gauged Skyrme model within a finite box in (3+1)-dimensional flat space-time. There are two types of gauged solitons. The first…
This research concerns design optimization problems involving numerous design parameters and large computational models. These problems generally consist in non-convex constrained optimization problems in large and sometimes complex search…
Quantum annealing is a new method for finding extrema of multidimensional functions. Based on an extension of classical, simulated annealing, this approach appears robust with respect to avoiding local minima. Further, unlike some of its…
In the semi-classical approach to the Skyrme model, nuclei are approximated by quantum mechanical states on a finite-dimensional space of field configurations; in zero-mode quantization this space is generated by rotations and isorotations.…
We consider the classical static soliton solutions of the Skyrme model with false vacuum potential. We make use of fully three-dimensional relaxation calculations to construct global energy minimizers in the sectors of topological degrees…
In this talk, we give new insight into one of the best-known nonlinear field theories, the Skyrme model. We present some exact relevant solutions coming from different new versions (gauged BPS baby as well as vector BPS Skyrme models)…
The Skyrme model can be generalised to a situation where static fields are maps from one Riemannian manifold to another. Here we study a Skyrme model where physical space is two-dimensional euclidean space and the target space is the…
We study the simulated annealing algorithm based on the kinetic Langevin dynamics, in order to find the global minimum of a non-convex potential function. For both the continuous time formulation and a discrete time analogue, we obtain the…
Many important challenges in science and technology can be cast as optimization problems. When viewed in a statistical physics framework, these can be tackled by simulated annealing, where a gradual cooling procedure helps search for…
Simulated annealing (SA) is applied for three-dimensional (3D) equilibrium calculation of ideal, low-beta reduced MHD in cylindrical geometry. The SA is based on the theory of Hamiltonian mechanics. The dynamical equation of the original…
We consider soliton solutions of the U(1) gauged Skyrme model with the pion mass term. The domain of existence of gauged Skyrmions is restricted from above by the value of the pion mass. Concentrating on the solutions of topological degree…
We propose a new stochastic algorithm (generalized simulated annealing) for computationally finding the global minimum of a given (not necessarily convex) energy/cost function defined in a continuous D-dimensional space. This algorithm…
The protocol of quantum annealing is applied to an optimization problem with a one-dimensional continuous degree of freedom, a variant of the problem proposed by Shinomoto and Kabashima. The energy landscape has a number of local minima,…
This study combines simulated annealing with delta evaluation to solve the joint stratification and sample allocation problem. In this problem, atomic strata are partitioned into mutually exclusive and collectively exhaustive strata. Each…