qpSWIFT
A Sparse Quadratic Programming Solver
|
#include <math.h>
#include <stdio.h>
#include "stdlib.h"
Go to the source code of this file.
Macros | |
#define | MAX(X, Y) ((X) < (Y) ? (Y) : (X)) |
#define | MIN(X, Y) ((X) > (Y) ? (Y) : (X)) |
#define | MALLOC malloc |
#define | FREE free |
#define | PRINT printf |
#define | qp_real double |
#define | qp_int long |
#define | MAXIT (100) |
#define | RELTOL (1e-6) |
#define | ABSTOL (1e-6) |
#define | SIGMA (100) |
#define | VERBOSE (0) |
#define | QP_OPTIMAL (0) |
#define | QP_KKTFAIL (1) |
#define | QP_MAXIT (2) |
#define | QP_FATAL (3) |
#define | ROW_MAJOR_ORDERING (20) |
#define | COLUMN_MAJOR_ORDERING (30) |
#define | QP_PURE_NEWTON_STEP (0) |
#define | QP_CENTERING_CORRECTOR_STEP (1) |
#define | QP_CENTERING_STEP (2) |
#define ABSTOL (1e-6) |
s and z Tolerances
#define COLUMN_MAJOR_ORDERING (30) |
Column Major Ordering of the input Matrices; Used in QP_SETUP_dense
#define FREE free |
qpSWIFT free alias
#define MALLOC malloc |
qpSWIFT malloc alias
#define MAX | ( | X, | |
Y | |||
) | ((X) < (Y) ? (Y) : (X)) |
#define MAXIT (100) |
QP SOLVER Settings Maximum Number of Iterations
#define MIN | ( | X, | |
Y | |||
) | ((X) > (Y) ? (Y) : (X)) |
Minimum of two expressions
#define PRINT printf |
qpSWIFT printf alias
#define QP_CENTERING_CORRECTOR_STEP (1) |
Centering Corrector Step
#define QP_CENTERING_STEP (2) |
Centering Step
#define QP_FATAL (3) |
Unknown Problem in Solver
#define qp_int long |
QP Specific Varibles
#define QP_KKTFAIL (1) |
Failure in solving LDL' factorization
#define QP_MAXIT (2) |
Maximum Number of Iterations Exceeded
#define QP_OPTIMAL (0) |
QP SOLVER FLAGS(EXITCODES) and their Definitions Optimal Solution Found
#define QP_PURE_NEWTON_STEP (0) |
Pure Newton Step
#define qp_real double |
QP Specific Varibles
#define RELTOL (1e-6) |
Residual Error Tolerances
#define ROW_MAJOR_ORDERING (20) |
Row Major Ordering of the input Matrices; Used in QP_SETUP_dense
#define SIGMA (100) |
Centering Parameter
#define VERBOSE (0) |
Default Verbose Option