Subspace accelerated matrix splitting algorithms for bound-constrained quadratic programming and linear complementarity problems

This paper studies the solution of two problems—bound-constrained quadratic programs and linear complementarity problems—by two-phase methods that consist of an active set prediction phase and a subspace phase. The algorithms enjoy favorable convergence properties under weaker assumptions than those assumed for other methods in the literature. The active set prediction phase employs matrix splitting iterations … Read more

On the Solution of Complementarity Problems Arising in American Options Pricing

In the Black-Scholes-Merton model, as well as in more general stochastic models in finance, the price of an American option solves a system of partial differential variational inequalities. When these inequalities are discretized, one obtains a linear complementarity problem that must be solved at each time step. This paper presents an algorithm for the solution … Read more