A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
Luigi Grippo (grippodis.uniroma1.it)
Abstract: In this paper we study a class of derivative-free unconstrained minimization algorithms employing nonmonotone inexact linesearch techniques along a set of suitable search directions. In particular, we define globally convergent nonmonotone versions of some well-known derivative-free methods and we propose a new algorithm combining coordinate rotations with approximate simplex gradients. Through extensive numerical experimentation, we show that the proposed algorithm is highly competitive in comparison with some of the most efficient direct search methods and model based methods on a large set of test problems.
Keywords: Derivative-free Methods, Nonmonotone Techniques, Unconstrained Optimization.
Category 1: Nonlinear Optimization
Category 2: Nonlinear Optimization (Unconstrained Optimization )
Entry Submitted: 02/20/2013
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|