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 20 of 436 for “"Local minima"”.
-
A Study of Local Minima in Structural Design
Made available in DSpace on 2014-12-13T19:31:56Z (GMT). No. of bitstreams: 1 8004191.pdf: 6571167 bytes, checksum: 55be8041046d80ca8f37272f620ae2c3 (MD5) Previous issue date: 1979
-
Overcoming Local Minima Through Viscoelastic Fluid-Inspired Swarm Behavior
… algorithm to mitigate the trapping effects of local minima, which are known to affect physicomimetics-based potential field control methods. Once a robot senses the goal, local communication between robots is used to propagate path-to-goal gradient information through the swarm's communication …
-
Local Minima in Mixture Problems and their Algorithmic Implications
… negative log-likelihood function has only two local minima, which both correspond to a true location parameter. This benign landscape allows for the global convergence of generic algorithms for solving the maximum likelihood estimator (MLE), such as gradient descent (GD) and the …
-
Positive Solutions Obtained as Local Minima via Symmetries, for Nonlinear Elliptic Equations
… of the work of Z.-Q. Wang, where existence of local minima in the space of symmetric functions was studied for the Schrödinger equation. We illustrate the general theory with three examples, all of which produce new results. Our method allows the construction of solutions with prescribed …
-
Investigation of local minima in autonomous potential field agents/vehicles in pure dynamic environment
… On the other hand, PFM algorithms experience local minima. Nevertheless, local minima for PFM are extensively studied in different environments; they have never studied in a Pure Dynamic Environment (PDE). PDE is a new dynamic environment in which all its elements are guaranteed to be dynamic …
-
Neural Networks and the Natural Gradient
… have always suffered from the problem of local minima. The advent of natural gradient algorithms promised to overcome this shortcoming by finding better local minima. However, they require additional training parameters and computational overhead. By using a new formulation for the natural …
-
Non-local active contours
… contour has a tendency to get stuck at undesired local minima caused by subtle and undesired image features/edges. Thus, active contour based curve evolution approaches are very sensitive to initialization and noise. The central theme of this thesis is to develop techniques that can make active …
-
Boundary mapping and its application to geographic routing
… to the lack of global information to deal with local minima at voids or the outer boundary. To address this problem, an improved geographic forwarding strategy Greedy-BoundedCompass was developed to reduce the instance of local minima. Greedy-BoundedCompass allows packets to move away from the …
-
Re-Active Vector Equilibrium: A Novel Method of Autonomous Vehicle Navigation using Artificial Potential Fields
… schemes in robotics has been limited by inherent local minima issues. Local minima traps, small passages, unstable motion, and targets positioned near objects all pose major concerns when using potential fields for local vehicle control. This work proposes a new algorithm, "Re-Active Vector …
-
Multiscale Active Contour Methods in Computer Vision with Applications in Tomography
… is they are notoriously ridden with sub-optimal local minima. The second is that they typically require high computational cost to be solved robustly. The reason for these two drawbacks is that most problems in computer vision, even when well-defined, typically require finding a solution in a …
-
Neural Networks: Training and Application to Nonlinear System Identification and Control
… can be inefficient and can get trapped in local minima. Two global optimization approaches are adapted to train neural networks and avoid the local minima problem. Lyapunov theory is used to prove the stability of the proposed methodology and its convergence in the presence of measurement …
-
A Nonlinear Differential Semblance Algorithm for Waveform Inversion
… because of the existence of many spurious local minima of the objective function for typical data that lacks low-frequency energy. Nonlinear differential semblance optimization combines the ability of full waveform inversion to account for nonlinear physical effects, such as multiple …
-
Simulated Annealing with min-cut and greedy perturbations
… Such an approach allows the algorithm to avoid local minima and find satisfactory solutions. One problem faced by Simulated Annealing is that it can take a very large number of iterations to reach a desired result. Greedy perturbations use knowledge of the system to generate solutions which may …
-
Modelling Genetic Algorithms and Evolving Populations
… caricature of an optimisation problem with many local minima is considered — the basin with a barrier problem. The first passage time — the time required to escape the local minima to the global minimum — is calculated and insights gained as to how the genetic algorithm is searching the …
-
Magnetic micro-confinement of quantum degenerate gases
… single or multiple micro-traps of magnetic field local minima distributed, at a certain working distance, above the surface of a thin film of permanent magnetic material. The simplicity in creating the magnetic field local minima at the micro-scale manifests itself as a result of imprinting …
-
Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects
… 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 framework through basic information-theoretic techniques such as maximum entropy …
-
Clustering solutions: a novel approach to solving NP-complete problems
… researchers analysed the relationship between local and global minima and provided an insight into the configuration of the landscape. It was found that local minima formed clusters around global ones. We expanded these analyses to cover the relationship between clusters, and found that local …
-
A global optimization technique for zero-residual nonlinear least-squares problems
… globalization strategy for approximating global minima of zero-residual least-squares problems. This class of nonlinear programming problems arises often in data-fitting applications in the fields of engineering and applied science. Such minimization problems are formulated as a sum of squares of …
-
Motion planning for multi-link robots with artificial potential fields and modified simulated annealing
… in order for the robots to recover from a local minima. Modifications to the SA algorithm improve the performance of the algorithm and reduce convergence time. Validation on a three-link snake robot shows that the derived control laws from the motion planning algorithm that combine APF and …
-
Nonlinear parameter estimation in classification problems
… thesis, is that estimates may be attracted to local minima of the cost function. This is a problem because local minima occur in many interesting cases. Therefore a modified version of the algorithm, which avoids local minima traps, is presented. In the new algorithm, a number of parameter …
Page 1 of 22