nnoc

This function is the interface to the reference class <code>NNOC</code> for
 creating linear constraints.

classes

Routines for solving convex optimization problems with cone constraints by means of interior-point methods. The implemented algorithms are partially ported from CVXOPT, a Python module for convex optimization (see <https://cvxopt.org> for more information).

Bernhard Pfaff

cccp

Cone Constrained Convex Problems

Lieven Vandenberghe

Martin Andersen

Joachim Dahl

nnoc function

<dl> <dt>G</dt>
<dd>Object of class <code>"matrix"</code>: A \((m \times n)\) matrix
 containing the coefficients of the lefthand-side linear inequality
 constraints.</dd>
 
 <dt>h</dt>
<dd>Object of class <code>NNOV</code>: A \((m \times 1)\) vector
 containing the coefficients of the righthand-side linear inequality
 constraints as slot <code>u</code>.</dd></dl>

Arguments

Definition of linear inequality constraints — nnoc

<dl>

 <dt>G</dt>
<dd>Object of class <code>"matrix"</code>: A \((m \times n)\) matrix
 containing the coefficients of the lefthand-side linear inequality
 constraints.</dd>
 
 <dt>h</dt>
<dd>Object of class <code>NNOV</code>: A \((m \times 1)\) vector
 containing the coefficients of the righthand-side linear inequality
 constraints as slot <code>u</code>.</dd>

</dl>

nnoc: Definition of linear inequality constraints

Description

Usage

Value

Arguments