split_solution

Mirrors <code>ParamConeProg.split_solution</code> in
<code>cone_matrix_stuffing.py:282-302</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

split_solution function

<dl><dt>param_prog</dt>
<dd>A <code>ParamConeProg</code>.</dd>
<dt>sltn</dt>
<dd>Numeric vector of length <code>x_length</code> -- the primal <code>x</code>
from the conic forward solve.</dd>
<dt>active_vars</dt>
<dd>Optional character vector of variable ids to
restrict the output to. Default: all variables.</dd></dl>

Arguments

Split a primal solution into per-variable arrays — split_solution

<dl>

<dt>param_prog</dt>
<dd>A <code>ParamConeProg</code>.</dd>


<dt>sltn</dt>
<dd>Numeric vector of length <code>x_length</code> -- the primal <code>x</code>
from the conic forward solve.</dd>


<dt>active_vars</dt>
<dd>Optional character vector of variable ids to
restrict the output to. Default: all variables.</dd>

</dl>

split_solution: Split a primal solution into per-variable arrays

Description

Usage

Value

Arguments