MERLIN-3. 0. A multidimensional optimization environment

DOI10.1016/S0010-4655(98)00005-8zbMath0936.65072WikidataQ126297366 ScholiaQ126297366MaRDI QIDQ1299612

D. G. Papageorgiou, I. N. Demetropoulos, Isaac E. Lagaris

Publication date: 22 May 2000

Published in: Computer Physics Communications (Search for Journal in Brave)

zbMATH Keywords

modellingcurve-fittingmultidimensional minimizationneural network trainingsprogram package MERLIN

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Learning and adaptive systems in artificial intelligence (68T05) Packaged methods for numerical algorithms (65Y15)

Related Items

Newtonian clustering: an approach based on molecular dynamics and global optimization ⋮ DiracSolver: a tool for solving the Dirac equation ⋮ On nonstandard vacuua in minimal supergravity models ⋮ Probability density estimation using artificial neural networks ⋮ MERLIN ⋮ Training the random neural network using quasi-Newton methods

Uses Software

• RANLUX
• minpack
• MCL
• TOLMIN
• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• A tolerant algorithm for linearly constrained optimization calculations
• An efficient line search for nonlinear least squares
• Two new unconstrained optimization algorithms which use function and gradient values
• The MERLIN control language for strategic optimization
• Generalized Polak-Ribière algorithm
• RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives
• Neural network training and simulation using a multidimensional optimization system
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• A Family of Variable-Metric Methods Derived by Variational Means
• The Convergence of a Class of Double-rank Minimization Algorithms
• A new approach to variable metric algorithms
• On Steepest Descent
• Conditioning of Quasi-Newton Methods for Function Minimization
• A Simplex Method for Function Minimization
• Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
• A method for the solution of certain non-linear problems in least squares