We consider the solution of bound constrained optimization problems, where we assume that the evaluation of the objective function is costly, its derivatives are unavailable and the use of exact derivative-free algorithms may imply a too large computational burden. There is plenty of real...

We consider an iterative preconditioning technique for non-convex large scale optimization. First, we refer to the solution of large scale indefinite linear systems by using a Krylov subspace method, and describe the iterative construction of a preconditioner which does not involve matrices...

This paper focuses on the solution of difficult multidisciplinary optimisation formulations arising in ship design. The latter schemes are by nature the result of the interaction among several optimisation problems. Each optimisation problem summarises the issues related to a specific aspect...