File numerics/src/AVI/AffineVariationalInequalities.h

File numerics/src/AVI/AffineVariationalInequalities.h#

Go to the source code of this file

Definitions for AVI

Functions

void AVI_display(AffineVariationalInequalities *avi)#

Affine Variational Inequalities display.

Parameters:

avi – pointer to the AffineVariationalInequalities to display

int AVI_printInFile(AffineVariationalInequalities *avi, FILE *file)#

write AVI to file

Parameters:
Returns:

1 if successfull

int AVI_newFromFile(AffineVariationalInequalities *avi, FILE *file)#

read from file and create AffineVariationalInequalities

Parameters:
Returns:

1 if successfull

int AVI_newFromFilename(AffineVariationalInequalities *avi, char *filename)#

function to read and create a AffineVariationalInequalities from a file

Parameters:
Returns:

1 if successfull

void freeAVI(AffineVariationalInequalities *avi)#

function to delete a AffineVariationalInequalities

Parameters:

avi – pointer to a AffineVariationalInequalities to delete

AffineVariationalInequalities *newAVI(void)#

Create an empty AVI struct.

Returns:

an empty AffineVariationalInequalities

struct AffineVariationalInequalities#
#include <AffineVariationalInequalities.h>

Structure that contains and defines an AVI.

The problem is : given a matrix \( M \) and a vector \( q \), find \( z \) such that

\[ \langle x - z, q + Mz \rangle \geq 0 \ \text{for all }x\in K \]

See users’guide for details.

Public Members

size_t size#

size of the problem

NumericsMatrix *M#

M matrix of the AVI (see the mathematical description)

double *q#

vector of the AVI (see the mathematical description)

double *d#

Covering vector (optional)

polyhedron_set poly#

Polyhedra where the solution has to belong.

double *lb#

Lower bounds for the variables.

double *ub#

Upper bounds for the variables.

void *cones#

Non-polyhedral Cones where the variable lives (not implemented yet)

Contents