graph_implementation

Reduces the atom to an affine expression and list of constraints.

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. Interfaces to solvers on CRAN and elsewhere are
provided, both commercial and open source.

Anqi Fu

CVXR

Disciplined Convex Optimization

Balasubramanian Narasimhan

David W Kang

Steven Diamond

John Miller

Stephen Boyd

Paul Kunsberg Rosenfield

graph_implementation function

<dl><dt>object</dt>
<dd>An Expression object.</dd>
<dt>arg_objs</dt>
<dd>A list of linear expressions for each argument.</dd>
<dt>dim</dt>
<dd>A vector representing the dimensions of the resulting expression.</dd>
<dt>data</dt>
<dd>A list of additional data required by the atom.</dd></dl>

Arguments

Graph Implementation — graph_implementation

<dl>

<dt>object</dt>
<dd>An Expression object.</dd>


<dt>arg_objs</dt>
<dd>A list of linear expressions for each argument.</dd>


<dt>dim</dt>
<dd>A vector representing the dimensions of the resulting expression.</dd>


<dt>data</dt>
<dd>A list of additional data required by the atom.</dd>

</dl>

graph_implementation: Graph Implementation

Description

Usage

Value

Arguments