sum_largest

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

sum_largest function

<dl><dt>x</dt>
<dd>An Expression</dd>
<dt>k</dt>
<dd>Number of largest entries to sum</dd>
<dt>axis</dt>
<dd>NULL (all entries), 1 (row-wise), or 2 (column-wise)</dd>
<dt>keepdims</dt>
<dd>Logical; keep the reduced dimension as size 1</dd></dl>

Arguments

Sum of k largest entries — sum_largest

<dl>

<dt>x</dt>
<dd>An Expression</dd>


<dt>k</dt>
<dd>Number of largest entries to sum</dd>


<dt>axis</dt>
<dd>NULL (all entries), 1 (row-wise), or 2 (column-wise)</dd>


<dt>keepdims</dt>
<dd>Logical; keep the reduced dimension as size 1</dd>

</dl>

Sum of k largest entries

sum_largest: Sum of k largest entries

Description

Usage

Value

Arguments