We have attempted to find the putative global minimum structures of Morse clusters for cluster size N=81-160 as a function of the range of the potential (with potential range rho0>or=3.0). Moreover, compared to the results for N<or=80 listed in the Cambridge Cluster Database, a number of new putative global minima are given. A structural and conformational analysis of M100 for different rho0 wa...

We investigate the loss surface of deep linear and nonlinear neural networks. We show that for deep linear networks with differentiable losses, critical points after the multilinear parameterization inherit the structure of critical points of the underlying loss with linear parameterization. As corollaries we obtain “local minima are global” results that subsume most previous results, while sho...

Neural network learning is the main essence of ANN. There are many problems associated with the multiple local minima in neural networks. Global optimization methods are capable of finding global optimal solution. In this paper we investigate and present a comparative study for the effects of probabilistic and deterministic global search method for artificial neural network using fully connecte...

We consider the generalized Nash equilibrium problem which, in contrast to the standard Nash equilibrium problem, allows joint constraints of all players involved in the game. Using a regularized Nikaido-Isoda-function, we then present three optimization problems related to the generalized Nash equilibrium problem. The first optimization problem is a complete reformulation of the generalized Na...

The Particle Swarm Optimizer, like many other evolutionary and classical minimization methods, su ers the problem of occasional convergence to local minima, especially in multimodal and scattered landscapes. In this work we propose a modi cation of the Particle Swarm Optimizer that makes use of a new technique, named Function \Stretching", to alleviate the local minima problem. Function \Stretc...

The magnitude and structure of the global total ozone minimum between 1958 and 1962 is similar to that observed between 1979 and 1983. Analysis of the single station data that exhibit the most pronounced minima suggest that the spatial structure of the global minimum is different from the currently observed reduction. Very low north polar values were observed, but there is no indication of anom...

We consider the least-squares (L2) triangulation problem and structure-and-motion with known rotatation, or known plane. Although optimal algorithms have been given for these algorithms under an L-infinity cost function, finding optimal least-squares (L2) solutions to these problems is difficult, since the cost functions are not convex, and in the worst case can have multiple minima. Iterative ...

There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local minima solutions can be obtained with simple implementations and usually require smaller computational time than global algorithms. Also, methods such as ICM can be readily implemented in a various difficult problems ...

In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25]. The Canonical model is specified by (i) a geometric representation of a target protein structure with amino acid residues via its contact graph, (ii) a binary folding code in which the amino acids are classified as...