The author presents a geospatial analysis of the Peru-Chile Trench located in the South Pacific Ocean by the Generic Mapping Tool (GMT) scripting toolset used to process and model data sets. The study goal is to perform geomorphological modelling by the comparison of two segments of the trench...

We study a generalized version of Coleman (1990)’s time iteration method (GTI) for solving dynamic optimization problems. Our benchmark framework is an irreversible investment model with labor-leisure choice. The GTI algorithm is simple to implement and provides advantages in terms of speed...

We propose a price impact model where changes in prices are purely driven by the order flow in the market. The stochastic price impact of market orders and the arrival rates of limit and market orders are functions of the market liquidity process which reflects the balance of the demand and...

We propose a class of execution algorithms that consists of a strategic layer and a speculative layer. The strategic layer is an optimal trading schedule that encodes the trader's objective, her tolerance to risk, and the impact of her own trades in the market. The schedule of the strategic...

In this paper we test a particular variant of the (Repulsive) Particle Swarm method on some rather difficult global optimization problems. A number of these problems are collected from the extant literature and a few of them are newly introduced. First, we introduce the Particle Swarm method of...

A more recent version of this paper has been published as Working Paper Biltoki 2011.08.

The objective of this paper is to introduce a new population-based (stochastic) heuristic to search the global optimum of a (continuous) multi-modal function and to assess its performance (on a fairly large number of benchmark functions) vis-à-vis that of two other well-established and very...

We introduce an envelope condition method (ECM) for solving dynamic programming problems. The ECM method is simple to implement, dominates conventional value function iteration and is comparable in accuracy and cost to Carroll’s (2005) endogenous grid method. Codes are available.

Numerical methods for dynamic programming often use value function iteration and interpolation. We present a novel shape-preserving rational spline approximation method that improves value function iteration in terms of both stability and accuracy compared to more common methods.

The aim of this technical report is to present some detailed explanations in order to help to understand and use the algorithm Branch and Fix Coordination for solving MultiStage Mixed Integer Problems (BFC- MSMIP). We have developed an algorithmic approach implemented in a C++ experimental code...