Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Deterministic Annealing"”.
-
Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects
The deterministic annealing (DA) method, used for the solution of several nonconvex problems, offers the ability to avoid shallow local minima of a given cost surface and the ability to minimize the cost function even when there are many local minima. The method is established in a probabilistic …
-
Latent class profile analysis : inference, estimation and its applications
… Applying the recursive formula, we implement deterministic annealing EM (Ueda and Nakano, 1998) and deterministic annealing variant of variational Bayes (Katahiral et al., 2008) in order to find parameter estimates on the global mode of the objective function. Both methods are based on the …
-
Convex relaxation methods for graphical models : Lagrangian and maximum entropy approaches
… models. In discrete models, we also introduce a deterministic annealing procedure, which introduces a temperature parameter to define a smoothed dual function and then gradually reduces the temperature to recover the (non-differentiable) Lagrangian dual. When strong duality holds, we recover the …
-
Clustering, coverage and aggregation methods for large networks
… method whose central part incorporates the Deterministic Annealing algorithm. Specifically, we solve a sequence of relaxed minimization problems by allowing soft cluster associations; as we gradually decrease the level of softness, the solution for the original problem is approached. We …
-
Maximum entropy principle approach for water distribution network optimization
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms
-
Maximum-entropy principle approach to the multiple travelling salesman problem and related problems
This thesis presents an investigation into the applications of the maximum-entropy principle as a heuristic for the multiple travelling salesman problem. This is a computationally complex problem which requires special treatment by conventional optimization techniques. Specific focus is given to …