graph_implementation

Get the Graph Implementation of an Atom

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

graph_implementation function

<dl><dt>x</dt>
<dd>An atom object.</dd>
<dt>arg_objs</dt>
<dd>List of canonicalized argument LinOps.</dd>
<dt>shape</dt>
<dd>Integer vector: target shape.</dd>
<dt>data</dt>
<dd>Optional atom-specific data.</dd>
<dt>...</dt>
<dd>Additional arguments.</dd></dl>

Arguments

Get the Graph Implementation of an Atom — graph_implementation

<dl>

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


<dt>arg_objs</dt>
<dd>List of canonicalized argument LinOps.</dd>


<dt>shape</dt>
<dd>Integer vector: target shape.</dd>


<dt>data</dt>
<dd>Optional atom-specific data.</dd>


<dt>...</dt>
<dd>Additional arguments.</dd>

</dl>

graph_implementation: Get the Graph Implementation of an Atom

Description

Usage

Value

Arguments