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...

<Para ID="Par2">[Figure not available: see fulltext.] </AbstractSection> Copyright Springer Science+Business Media New York 2015

This paper proposes a new way to measure and deal with risk within the portfolio selection problem using a skewness/semivariance biobjective optimization framework. The solutions of this biobjective optimization problem allow the investor to analyse the efficient trade-off between skewness and...

We consider the problem of minimizing a continuously differentiable function of several variables subject to simple bound constraints where some of the variables are restricted to take integer values. We assume that the first order derivatives of the objective function can be neither calculated...