The objective of this study is to compare the predictive ability of Bayesian regularization with Levenberg–Marquardt Artificial Neural Networks. To examine the best architecture of neural networks, the model was tested with one-, two-, three-, four-, and five-neuron architectures, respectively. MATLAB (2011a) was used for analyzing the Bayesian regularization and Levenberg–Marquardt learning al...

In this paper a modification on Levenberg-Marquardt algorithm for MLP neural network learning is proposed. The proposed algorithm has good convergence. This method reduces the amount of oscillation in learning procedure. An example is given to show usefulness of this method. Finally a simulation verifies the results of proposed method. Keywords—Levenberg-Marquardt, modification, neural network,...

Multidimensional scaling is a fundamental problem in data analysis and have a lot of applications. It’s goal is to look for an Euclidean graphic representation of a given set of data in a “low’ dimensional space (generally in IR or IR). This problem can be formulated as a nonlinear global optimization problem. To solve it, a Lenvenberg-Marquardt method is used upon different cost functions. Res...

Artificial neural networks (ANNs) have been promising tools for many applications. In recent years, a computer-aided design approach based on (ANNs) has been introduced to microwave modelling, simulation and optimization. In this work, the characteristic parameters of top shielded multilayered coplanar waveguides (CPWs) have been determined with the use of ANN models. These neural models were t...

In this paper, the problem of nonnegative matrix factorization (NMF) is considered. It is formulated as the optimization of a criterion with bound constraints. We propose an approach based on Givens parameterization of some positive vector, and criterion minimization is achieved using Levenberg-Marquardt algorithm. The performance of the developed NMF method is illustrated for the separation of...

A new, to my knowledge, procedure for retrieving the wave aberration from the point-spread function is presented. It uses the Levenberg-Marquardt optimization algorithm in a mutiresolution pyramidal scheme. The method, tested with simulated large aberrations without initial estimates, accelerates convergence and avoids stagnation in local minima.

Unconstrained optimization problems are closely related to systems of ordinary differential equations (ODEs) with gradient structure. In this work, we prove results that apply to both areas. We analyze the convergence properties of a trust region, or Levenberg–Marquardt, algorithm for optimization. The algorithm may also be regarded as a linearized implicit Euler method with adaptive timestep f...

the aim of this study was to estimate suspended sediment by the ann model, dt with cart algorithm and different types of src, in ten stations from the lorestan province of iran. the results showed that the accuracy of ann with levenberg-marquardt back propagation algorithm is more than the two other models, especially in high discharges. comparison of different intervals in models showed that r...

This report presents the studies carried out on two modifications suggested in the literature for Levenberg-Marquardt algorithm. The modifications are applicable to feed-forward neural networks. One modification [18], made on performance index, reduces computational complexity of the Levenberg-Marquardt algorithm, while the other one [17], made on calculation of the gradient information, improv...