pylops.optimization.cls_sparsity.FISTAยถ

class pylops.optimization.cls_sparsity.FISTA(Op, callbacks=None)[source]ยถ

Fast Iterative Shrinkage-Thresholding Algorithm (FISTA).

Solve an optimization problem with \(L_p, \; p=0, 0.5, 1\) regularization, given the operator Op and data y. The operator can be real or complex, and should ideally be either square \(N=M\) or underdetermined \(N<M\).

Parameters:
Oppylops.LinearOperator

Operator to invert

Attributes:
ncpmodule

Array module used by the solver (obtained via pylops.utils.backend.get_array_module) ). Available only after setup is called.

isjaxbool

Whether the input data is a JAX array or not.

Opmatveccallable

Function handle to Op.matvec or Op.matmat depending on the number of dimensions of y.

Oprmatveccallable

Function handle to Op.rmatvec or Op.rmatmat depending on the number of dimensions of y.

SOpmatveccallable

Function handle to SOp.matvec or SOp.matmat depending on the number of dimensions of y.

SOprmatveccallable

Function handle to SOp.rmatvec or SOp.rmatmat depending on the number of dimensions of y.

threshfcallable

Function handle to the chosen thresholding method.

threshfloat

Threshold.

resnumpy.ndarray

Residual vector of size \([N \times 1]\) used in the solver when preallocate=True. Available only after setup is called and updated at each call to step.

gradnumpy.ndarray

Gradient vector of size \([M \times 1]\) used in the solver when preallocate=True. Available only after setup is called and updated at each call to step.

x_untheshnumpy.ndarray

Unthresholded model vector of size \([M \times 1]\) used in the solver when preallocate=True. Available only after setup is called and updated at each call to step.

xoldnumpy.ndarray

Old model vector of size \([M \times 1]\) used in the solver when preallocate=True. Available only after setup is called and updated at each call to step.

SOpx_untheshnumpy.ndarray

Old model vector pre-multiplied by the regularization operator of size \([M_S \times 1]\) used in the solver when preallocate=True. Available only after setup is called and updated at each call to step.

normresoldfloat

Old norm of the residual.

tfloat

FISTA auxiliary coefficient (not used in ISTA).

costlist

History of the L2 norm of the total objectiv function. Available only after setup is called and updated at each call to step.

iiterint

Current iteration number. Available only after setup is called and updated at each call to step.

Raises:
NotImplementedError

If threshkind is different from hard, soft, half, soft-percentile, or half-percentile

ValueError

If perc=None when threshkind is soft-percentile or half-percentile

See also

OMP

Orthogonal Matching Pursuit (OMP).

ISTA

Iterative Shrinkage-Thresholding Algorithm (ISTA).

SPGL1

Spectral Projected-Gradient for L1 norm (SPGL1).

SplitBregman

Split Bregman for mixed L2-L1 norms.

Notes

Solves the following synthesis problem for the operator \(\mathbf{Op}\) and the data \(\mathbf{y}\):

\[J = \|\mathbf{y} - \mathbf{Op}\,\mathbf{x}\|_2^2 + \epsilon \|\mathbf{x}\|_p\]

or the analysis problem:

\[J = \|\mathbf{y} - \mathbf{Op}\,\mathbf{x}\|_2^2 + \epsilon \|\mathbf{SOp}^H\,\mathbf{x}\|_p\]

if SOp is provided.

The Fast Iterative Shrinkage-Thresholding Algorithm (FISTA) [1] is used, where \(p=0, 0.5, 1\). This is a modified version of ISTA solver with improved convergence properties and limited additional computational cost. Similarly to the ISTA solver, the choice of the thresholding algorithm to apply at every iteration is based on the choice of \(p\).

[1]

Beck, A., and Teboulle, M., โ€œA Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problemsโ€, SIAM Journal on Imaging Sciences, vol. 2, pp. 183-202. 2009.

Methods

__init__(Op[, callbacks])

callback(x, *args, **kwargs)

Callback routine

finalize([show])

Finalize solver

memory_usage([show, unit])

Compute memory usage of the solver

run(x[, niter, show, itershow])

Run solver

setup(y[, x0, niter, SOp, eps, alpha, ...])

Setup solver

solve(y[, x0, niter, SOp, eps, alpha, ...])

Run entire solver

step(x, z[, show])

Run one step of solver

Examples using pylops.optimization.cls_sparsity.FISTAยถ

03. Solvers (Advanced)

03. Solvers (Advanced)