This code implements Newton-like algorithms for computing the proximal operator of the anisotropic total-variation map, i.e., solving the optimization problem:
where
or if
$$ \Vert x\Vert_{TV,p} = \sum_{i=1}^{n-1}\sum_{j=1}^{m-1}\Vert x_{:,j}\Vert_{TV,p} + \Vert x_{i,:}\Vert_{TV,p}.$$
The code solves these optimization problesm for a given input
The code is written directly in FORTRAN95, built using the LAPACK libraries' interfaces directly (as they are also written directly in FORTRAN). It relies on a FORTRAN compiler, but was built with gfortran
in mind (this is the compiler the included Makefile
looks for).