.grad

R counterpart of CVXPY's <code>Atom._grad(self, values)</code>. Returns a list
of one Jacobian per argument, shape <code>(prod(arg.shape), prod(self.shape))</code>.
Called by the chain-rule walker <code>grad(x)</code>. The leading dot follows R's
private-name convention (cf. <code>.Machine</code>, <code>.libPaths</code>, <code>.cvxr_*</code>); the
name maps one-to-one onto CVXPY's <code>_grad</code>.

internal

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

.grad function

<dl><dt>x</dt>
<dd>An atom expression.</dd>
<dt>values</dt>
<dd>A list of numeric values, one per argument.</dd>
<dt>...</dt>
<dd>Reserved for future use; method dispatch ignores it.</dd></dl>

Arguments

Per-atom Subgradient Hook (private) — .grad

<dl>

<dt>x</dt>
<dd>An atom expression.</dd>


<dt>values</dt>
<dd>A list of numeric values, one per argument.</dd>


<dt>...</dt>
<dd>Reserved for future use; method dispatch ignores it.</dd>

</dl>

.grad: Per-atom Subgradient Hook (private)

Description

Usage

Value

Arguments