On methods of direct search for the solution of unconstrained nonlinear optimization problems

On methods of direct search for the solution of unconstrained nonlinear optimization problems

0.00 Avg rating—0 Votes
Article ID: iaor20003004
Country: Cuba
Volume: 20
Issue: 3
Start Page Number: 188
End Page Number: 202
Publication Date: Sep 1999
Journal: Revista de Investigacin Operacional
Authors: ,
Abstract:

Several non-derivate procedures for the solution of the non-constrained non-linear programming problem: min f(x) x∈ℜn are examined. Coordinate-descent, conjugate-directions, stochastic search and ‘simplex’ type-algorithms are included. These procedures are compared in relation to their performance for different test problems.

Reviews

Required fields are marked *. Your email address will not be published.