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.

Disciplined Convex Optimization

package-ubuntu-20.04-r-4.0.5#cran#CVXR-1.0-10

<p>The sum of the smallest k values of a matrix.
</p>

<table summary="R argblock">
<tr valign="top">
<td><code>x</code></td>
<td>
<p>An <a href="Expression-class.html">Expression</a> or numeric matrix.</p>
</td>
</tr>
<tr valign="top">
<td><code>k</code></td>
<td>
<p>The number of smallest values to sum over.</p>
</td>
</tr>
</table>

package-ubuntu-20.04-r-4.0.5#cran#CVXR-1.0-10#docs#SumSmallest

`x`	An Expression or numeric matrix.
`k`	The number of smallest values to sum over.

SumSmallest

Description

Usage

Arguments

Value

CVXR

We don't support your browser anymore