We describe an algorithm, based on the simplex method of linear programming, for solving the discrete l 1 approximation problem with any type of linear constraints. The numerical results reported here ...

Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on specific ...

Abstract: An inner approximation algorithm is proposed for path-constrained dynamic optimization (PCDO) by iteratively solving restrictions of PCDO (RPCDO). First, an upper bound function of the path ...

In this paper, we study the restoration of images simultaneously corrupted by blur and impulse noise via variational approach with a box constraint on the pixel values of an image. In the literature, ...