total_variation

Computes total variation using L1 norm of discrete gradients for vectors
and L2 norm of discrete gradients for matrices.

An object-oriented modeling language for disciplined
convex programming (DCP) as described in Fu, Narasimhan, and Boyd
(2020, <doi:10.18637/jss.v094.i14>). It allows the user to
formulate convex optimization problems in a natural way following
mathematical convention and DCP rules. The system analyzes the
problem, verifies its convexity, converts it into a canonical
form, and hands it off to an appropriate solver to obtain the
solution. This version uses the S7 object system for improved
performance and maintainability.

Anqi Fu

CVXR

Disciplined Convex Optimization

Balasubramanian Narasimhan

Steven Diamond

John Miller

Stephen Boyd

total_variation function

<dl><dt>value</dt>
<dd>An Expression or numeric constant (vector or matrix)</dd>
<dt>...</dt>
<dd>Additional matrix expressions extending the third dimension</dd></dl>

Arguments

Total variation of a vector or matrix — total_variation

<dl>

<dt>value</dt>
<dd>An Expression or numeric constant (vector or matrix)</dd>


<dt>...</dt>
<dd>Additional matrix expressions extending the third dimension</dd>

</dl>

total_variation: Total variation of a vector or matrix

Description

Usage

Value

Arguments