MinFinder v2.0: An improved version of MinFinder

Published: 15-10-2008| Version 1 | DOI: 10.17632/nfhfpcmt8r.1
Contributors:
Ioannis G. Tsoulos,
Isaac E. Lagaris

Description

Abstract A new version of the “MinFinder” program is presented that offers an augmented linking procedure for Fortran-77 subprograms, two additional stopping rules and a new start-point rejection mechanism that saves a significant portion of gradient and function evaluations. The method is applied on a set of standard test functions and the results are reported. Title of program: MinFinder v2.0 Catalogue Id: ADWU_v2_0 Nature of problem A multitude of problems in science and engineering are often reduced to minimizing a function of many variables. There are instances that a local optimum does not correspond to the desired physical solution and hence the search for a better solution is required. Local optimization techniques can be trapped in any local minimum. Global optimization is then the appropriate tool. For example, solving a non - linear system of equations via optimization, one may encounter many local minima that do no ... Versions of this program held in the CPC repository in Mendeley Data ADWU_v1_0; MinFinder; 10.1016/j.cpc.2005.10.001 ADWU_v2_0; MinFinder v2.0; 10.1016/j.cpc.2008.04.016 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)

Files