22#include "OSParameters.h"
33using std::ostringstream;
37 bVariablesModified(false),
38 bObjectivesModified(false),
39 bConstraintsModified(false),
40 bAMatrixModified(false),
42 m_sInstanceSource(
""),
43 m_sInstanceDescription(
""),
44 m_sInstanceCreator(
""),
45 m_sInstanceLicence(
""),
46 m_bProcessVariables(false),
47 m_iVariableNumber(-1),
48 m_iNumberOfIntegerVariables( 0),
49 m_iNumberOfBinaryVariables( 0),
50 m_iNumberOfSemiContinuousVariables( 0),
51 m_iNumberOfSemiIntegerVariables( 0),
52 m_iNumberOfStringVariables( 0),
53 m_msVariableNames(NULL),
54 m_mcVariableTypes(NULL),
55 m_mdVariableLowerBounds(NULL),
56 m_mdVariableUpperBounds(NULL),
59 m_bProcessObjectives(false),
60 m_iObjectiveNumber(-1),
61 m_iObjectiveNumberNonlinear( 0),
62 m_msObjectiveNames(NULL),
64 m_miNumberOfObjCoef(NULL),
65 m_mdObjectiveConstants(NULL),
66 m_mdObjectiveWeights(NULL),
67 m_mObjectiveCoefficients(NULL),
68 m_bGetDenseObjectives(false),
69 m_mmdDenseObjectiveCoefficients(NULL),
70 m_bProcessConstraints(false),
71 m_iConstraintNumber(-1),
72 m_iConstraintNumberNonlinear( 0),
73 m_msConstraintNames(NULL),
74 m_mdConstraintLowerBounds(NULL),
75 m_mdConstraintUpperBounds(NULL),
76 m_mdConstraintConstants( NULL),
77 m_mcConstraintTypes(NULL),
78 m_bProcessLinearConstraintCoefficients(false),
79 m_iLinearConstraintCoefficientNumber(-1),
81 m_linearConstraintCoefficientsInColumnMajor(NULL),
82 m_linearConstraintCoefficientsInRowMajor(NULL),
83 m_iNumberOfQuadraticRowIndexes( 0),
84 m_bQuadraticRowIndexesProcessed(false),
85 m_miQuadRowIndexes( NULL),
86 m_bProcessQuadraticTerms(false),
87 m_iQuadraticTermNumber(-1),
88 m_quadraticTerms( NULL),
89 m_bQTermsAdded( false),
90 m_iNumberOfNonlinearExpressionTreeIndexes( 0),
91 m_bNonlinearExpressionTreeIndexesProcessed( false),
92 m_miNonlinearExpressionTreeIndexes( NULL),
93 m_iNumberOfNonlinearExpressionTreeModIndexes( 0),
94 m_bNonlinearExpressionTreeModIndexesProcessed( false),
95 m_miNonlinearExpressionTreeModIndexes( NULL),
96 m_binitForAlgDiff( false),
97 m_iNumberOfNonlinearVariables( 0),
98 m_bProcessNonlinearExpressions( false),
99 m_iNonlinearExpressionNumber( -1),
100 m_miNonlinearExpressionIndexes( NULL),
101 m_bProcessExpressionTrees( false),
102 m_bProcessExpressionTreesMod( false),
103 m_mdConstraintFunctionValues( NULL),
104 m_mdObjectiveFunctionValues( NULL),
109 m_miJacNumConTerms( NULL),
110 m_sparseJacMatrix( NULL),
111 m_iHighestTaylorCoeffOrder(-1),
112 m_LagrangianExpTree(NULL),
113 m_bLagrangianExpTreeCreated( false),
114 m_LagrangianSparseHessian( NULL),
115 m_bLagrangianSparseHessianCreated( false),
116 m_miNonLinearVarsReverseMap( NULL),
117 m_bAllNonlinearVariablesIndex( false),
118 m_bOSADFunIsCreated( false),
119 m_bCppADTapesBuilt( false),
120 m_bCppADMustReTape( false),
121 m_bDuplicateExpressionTreesMap( false),
122 m_bNonLinearStructuresInitialized( false),
123 m_bSparseJacobianCalculated( false),
124 m_iHighestOrderEvaluated( -1),
125 m_mmdObjGradient( NULL),
126 m_bProcessMatrices( false),
127 m_iMatrixNumber (-1),
128 m_miMatrixSymmetry(NULL),
129 m_miMatrixType(NULL),
130 m_miMatrixNumberOfColumns(NULL),
131 m_miMatrixNumberOfRows(NULL),
132 m_msMatrixNames(NULL),
140 m_iMatrixVarNumber(-1),
141 m_iMatrixObjNumber(-1),
142 m_iMatrixConNumber(-1),
143 m_iMatrixExpressionNumber(-1),
145 m_bProcessTimeDomain( false),
146 m_bProcessTimeStages( false),
147 m_bProcessTimeInterval( false),
148 m_bFiniteTimeStages( false),
149 m_iNumberOfTimeStages(-1),
150 m_sTimeDomainFormat(
""),
151 m_msTimeDomainStageNames(NULL),
152 m_miTimeDomainStageVariableNumber(NULL),
153 m_mmiTimeDomainStageVarList(NULL),
154 m_miTimeDomainStageConstraintNumber(NULL),
155 m_mmiTimeDomainStageConList(NULL),
156 m_miTimeDomainStageObjectiveNumber(NULL),
157 m_mmiTimeDomainStageObjList(NULL),
158 bUseExpTreeForFunEval( false)
169 std::ostringstream outStr;
174 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
222 outStr <<
"Delete m_msObjectiveNames" << std::endl;
223 outStr <<
"Delete m_msMaxOrMins" << std::endl;
224 outStr <<
"Delete m_miNumberOfObjCoef" << std::endl;
225 outStr <<
"Delete m_mdObjectiveConstants" << std::endl;
226 outStr <<
"Delete m_mdObjectiveWeights" << std::endl;
285 outStr <<
"deleting Objective function gradient " << i << std::endl;
299 "Do garbage collection for the nonlinear API");
357 outStr <<
"Deleting an expression tree from the map for row " << posMapExpTree->first << std::endl;
405 throw ErrorClass(
"Error: An Algorithmic Differentiation Package Not Available");
442 if (m_mExpandedMatricesInColumnMajor != NULL)
446 if (m_mExpandedMatricesInColumnMajor[i] != NULL)
447 delete m_mExpandedMatricesInColumnMajor[i];
448 m_mExpandedMatricesInColumnMajor[i] = NULL;
450 delete[] m_mExpandedMatricesInColumnMajor;
451 m_mExpandedMatricesInColumnMajor = NULL;
454 if (m_mExpandedMatricesInRowMajor != NULL)
458 if (m_mExpandedMatricesInRowMajor[i] != NULL)
459 delete m_mExpandedMatricesInRowMajor[i];
460 m_mExpandedMatricesInRowMajor[i] = NULL;
462 delete[] m_mExpandedMatricesInRowMajor;
463 m_mExpandedMatricesInRowMajor = NULL;
466 if (m_mMatrixBlocksInColumnMajor != NULL)
470 if (m_mMatrixBlocksInColumnMajor[i] != NULL)
471 delete m_mMatrixBlocksInColumnMajor[i];
472 m_mMatrixBlocksInColumnMajor[i] = NULL;
474 delete[] m_mMatrixBlocksInColumnMajor;
475 m_mMatrixBlocksInColumnMajor = NULL;
479 if (m_mMatrixTransformation != NULL)
483 if (m_mMatrixTransformation[i] != NULL)
484 delete m_mMatrixTransformation[i];
485 m_mMatrixTransformation[i] = NULL;
487 delete[] m_mMatrixTransformation;
488 m_mMatrixTransformation = NULL;
499 if (m_msTimeDomainStageNames != NULL)
501 delete[] m_msTimeDomainStageNames;
502 m_msTimeDomainStageNames = NULL;
505 if (m_miTimeDomainStageVariableNumber != NULL)
507 delete[] m_miTimeDomainStageVariableNumber;
508 m_miTimeDomainStageVariableNumber = NULL;
511 if (m_mmiTimeDomainStageVarList != NULL)
513 for (
int i = 0; i < m_iNumberOfTimeStages; i ++)
514 delete[] m_mmiTimeDomainStageVarList[i];
515 delete[] m_mmiTimeDomainStageVarList;
516 m_mmiTimeDomainStageVarList = NULL;
519 if (m_miTimeDomainStageConstraintNumber != NULL)
521 delete[] m_miTimeDomainStageConstraintNumber;
522 m_miTimeDomainStageConstraintNumber = NULL;
525 if (m_mmiTimeDomainStageConList != NULL)
527 for (
int i = 0; i < m_iNumberOfTimeStages; i ++)
528 delete[] m_mmiTimeDomainStageConList[i];
529 delete[] m_mmiTimeDomainStageConList;
530 m_mmiTimeDomainStageConList = NULL;
533 if (m_miTimeDomainStageObjectiveNumber != NULL)
535 delete[] m_miTimeDomainStageObjectiveNumber;
536 m_miTimeDomainStageObjectiveNumber = NULL;
539 if (m_mmiTimeDomainStageObjList != NULL)
541 for (
int i = 0; i < m_iNumberOfTimeStages; i ++)
542 delete[] m_mmiTimeDomainStageObjList[i];
543 delete[] m_mmiTimeDomainStageObjList;
544 m_mmiTimeDomainStageObjList = NULL;
549 delete instanceHeader;
550 instanceHeader = NULL;
705 numberOfConstraints(0),
736 iNumberOfStartElements( 0)
787 numberOfQuadraticTerms(0),
845 numberOfNonlinearExpressions(0) ,
855 std::ostringstream outStr;
872 outStr <<
"DESTROYING EXPRESSION " << i <<
"(row " <<
nl[ i]->
idx <<
")" << endl;
894 numberOfMatrices(0) ,
904 std::ostringstream outStr;
921 outStr <<
"DESTROYING MATRIX " << i << endl;
950 std::ostringstream outStr;
967 outStr <<
"DESTROYING CONE " << i << endl;
990 numberOfOtherIndexes(0),
1014 return "genericCone";
1033 return "nonnegativeCone";
1052 return "nonpositiveCone";
1083 return "orthantCone";
1087 referenceMatrixIdx(0)
1103 return "polyhedralCone";
1108 normScaleFactor(1.0),
1109 distortionMatrixIdx(-1),
1126 return "quadraticCone";
1131 normScaleFactor(1.0),
1132 distortionMatrixIdx(-1),
1133 firstAxisDirection(0),
1134 secondAxisDirection(1)
1150 return "rotatedQuadraticCone";
1157 semidefiniteness(
"positive"),
1158 isPositiveSemiDefinite(true)
1174 return "semidefiniteCone";
1193 return "copositiveMatricesCone";
1213 return "completelyPositiveMatricesCone";
1236 return "productCone";
1260 return "intersectionCone";
1306 matrixVariables(NULL),
1307 matrixObjectives(NULL),
1308 matrixConstraints(NULL),
1309 matrixExpressions(NULL)
1337 numberOfMatrixVar(0),
1347 std::ostringstream outStr;
1364 outStr <<
"DESTROYING MATRIXVAR " << i << endl;
1385 numberOfMatrixObj(0),
1395 std::ostringstream outStr;
1412 outStr <<
"DESTROYING MATRIXOBJ " << i << endl;
1433 numberOfMatrixCon(0),
1443 std::ostringstream outStr;
1460 outStr <<
"DESTROYING MATRIXCON " << i << endl;
1491 std::ostringstream outStr;
1508 outStr <<
"DESTROYING EXPR " << i <<
"(\"row\" " <<
expr[i]->
idx <<
")" << endl;
1532 templateMatrixIdx(-1),
1533 varReferenceMatrixIdx(-1),
1557 templateMatrixIdx(-1),
1558 objReferenceMatrixIdx(-1),
1560 constantMatrixIdx(-1),
1579 templateMatrixIdx(-1),
1580 conReferenceMatrixIdx(-1),
1641 numberOfVariables(0),
1686 numberOfConstraints(0),
1731 numberOfObjectives(0),
1870 linearConstraintCoefficients(NULL),
1871 quadraticCoefficients(NULL),
1872 nonlinearExpressions(NULL),
1875 matrixProgramming(NULL),
1968 throw ErrorClass(
"instanceHeader object undefined in method getInstanceName()");
1979 throw ErrorClass(
"instanceHeader object undefined in method getInstanceSource()");
1990 throw ErrorClass(
"instanceHeader object undefined in method getInstanceDescription()");
2001 throw ErrorClass(
"instanceHeader object undefined in method getInstanceCreator()");
2012 throw ErrorClass(
"instanceHeader object undefined in method getInstanceLicence()");
2023 throw ErrorClass(
"data object undefined in method getVariableNumber()");
2055 for(i = 0; i < n; i++)
2098 throw ErrorClass(
"variable type not yet implemented");
2179 throw ErrorClass(
"data object undefined in method getVariableNumber()");
2209 for(i = 0; i < n; i++)
2218 for(i = 0; i < n; i++)
2228 throw ErrorClass(
"objective coefficient number inconsistent with objective coefficient array");
2293 int i, j, numobjcoef;
2301 for(i = 0; i < m; i++)
2308 for(i = 0; i < m; i++)
2311 for(j = 0; j < n; j++)
2316 numobjcoef = sparsevec->
number;
2317 for(j = 0; j < numobjcoef; j++)
2320 += sparsevec->
values[ j];
2332 throw ErrorClass(
"data object undefined in method getConstraintNumber()");
2346 ostringstream outStr;
2362 for(i = 0; i < n; i++)
2370 outStr <<
"Constraint " ;
2372 outStr <<
" is infeasible";
2377 outStr <<
"Constraint " ;
2379 outStr <<
" is infeasible";
2444 throw ErrorClass(
"data object undefined in method getLinearConstraintCoefficientNumber()");
2467 throw ErrorClass(
"ambiguous linear constraint coefficient major");
2570 throw ErrorClass(
"data object undefined in method getNumberOfQuadraticTerms()");
2589 if(!quadraticCoefs->
qTerm && n != 0)
2590 throw ErrorClass(
"quadratic term number inconsistent with quadratic term array");
2599 for(i = 0; i < n; i++)
2625 if(n <= 0)
return NULL;
2628 std::map<int, int> foundIdx;
2629 std::map<int, int>::iterator pos;
2633 for(i = 0; i < n; i++)
2642 for(pos = foundIdx.begin(); pos != foundIdx.end(); ++pos)
2661 throw ErrorClass(
"data object undefined in method getNumberOfNonlinearExpressions()");
2691 std::map<int, ScalarExpressionTree*> expTrees;
2694 std::map<int, ScalarExpressionTree*>::iterator pos;
2701 for(pos = expTrees.begin(); pos != expTrees.end(); ++pos)
2724 std::map<int, ScalarExpressionTree*> expTrees;
2726 std::map<int, ScalarExpressionTree*>::iterator pos;
2733 for(pos = expTrees.begin(); pos != expTrees.end(); ++pos)
2789 std::vector<ExprNode*> postfixVec;
2799 throw ErrorClass(
"Error in getNonlinearExpressionTreeInPostfix, rowIdx not valid");
2814 std::string resultString;
2819 ostringstream outStr;
2820 std::vector<ExprNode*> postfixVec;
2822 int rowIdx = rowIdx_;
2830 std::string tmp1 =
"";
2831 std::string tmp2 =
"";
2832 std::string tmp3 =
"";
2833 std::stack<ExprNode*> opStack;
2834 std::stack<std::string> tmpStack;
2835 std::stack<std::string> sumStack;
2836 std::stack<std::string> productStack;
2837 std::stack<std::string> minStack;
2838 std::stack<std::string> maxStack;
2851 n = postfixVec.size();
2853 for (i = 0 ; i < n; i++)
2855 nlnode = postfixVec[ n - 1 - i];
2856 opStack.push( nlnode);
2860 for(i = 0; i < n; i++)
2862 nlnode = opStack.top();
2871 tmpStack.push(
"PI" );
2875 tmpStack.push(
"E" );
2883 if( (nlnodeVar->
coef > 1.0) || (nlnodeVar->
coef < 1.0) )
2888 outStr << nlnodeVar->
idx;
2890 tmpStack.push(outStr.str() );
2895 outStr << nlnodeVar->
idx;
2896 tmpStack.push(outStr.str() );
2901 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing plus operator");
2902 tmp1 = tmpStack.top();
2904 tmp2 = tmpStack.top();
2906 tmpStack.push(
"(" + tmp2 +
" + " + tmp1 +
")");
2910 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing sum operator");
2916 sumStack.push( tmpStack.top() );
2922 outStr << sumStack.top();
2923 if (j < nlnodeSum->inumberOfChildren - 1) outStr <<
" + ";
2927 tmpStack.push( outStr.str() );
2932 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing minus operator");
2933 tmp1 = tmpStack.top();
2935 tmp2 = tmpStack.top();
2937 tmpStack.push(
"(" + tmp2 +
" - " + tmp1 +
")");
2941 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- -- Problem writing negate operator");
2942 tmp1 = tmpStack.top();
2944 tmpStack.push(
"-"+ tmp1 );
2950 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing times operator");
2951 tmp1 = tmpStack.top();
2953 tmp2 = tmpStack.top();
2955 tmpStack.push(
"(" + tmp2 +
"*" + tmp1 +
")");
2959 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing divide operator");
2960 tmp1 = tmpStack.top();
2962 tmp2 = tmpStack.top();
2964 tmpStack.push(
"(" + tmp2 +
" / " + tmp1 +
")");
2968 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing power operator");
2969 tmp1 = tmpStack.top();
2971 tmp2 = tmpStack.top();
2973 tmpStack.push(
"(" + tmp2 +
" ^ " + tmp1 +
")");
2978 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing abs operator");
2979 tmp1 = tmpStack.top();
2981 tmpStack.push(
"abs( "+ tmp1 +
")");
2985 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing erf operator");
2986 tmp1 = tmpStack.top();
2988 tmpStack.push(
"erf( "+ tmp1 +
")");
2993 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing square operator ");
2994 tmp1 = tmpStack.top();
2996 tmpStack.push(
"("+ tmp1 +
")^2");
3000 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing ln operator");
3001 tmp1 = tmpStack.top();
3003 tmpStack.push(
"ln( "+ tmp1 +
")");
3007 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing exp operator");
3008 tmp1 = tmpStack.top();
3010 tmpStack.push(
"exp( "+ tmp1 +
")");
3014 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing sin operator");
3015 tmp1 = tmpStack.top();
3017 tmpStack.push(
"sin( "+ tmp1 +
")");
3021 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing cos operator ");
3022 tmp1 = tmpStack.top();
3024 tmpStack.push(
"cos( "+ tmp1 +
")");
3028 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing sqrt operator ");
3029 tmp1 = tmpStack.top();
3031 tmpStack.push(
"sqrt( "+ tmp1 +
")");
3035 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing min operator");
3041 minStack.push( tmpStack.top() );
3047 outStr << minStack.top();
3048 if (j < nlnodeMin->inumberOfChildren - 1) outStr <<
" , ";
3052 tmpStack.push( outStr.str() );
3057 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing max operator");
3063 maxStack.push( tmpStack.top() );
3069 outStr << maxStack.top();
3070 if (j < nlnodeMax->inumberOfChildren - 1) outStr <<
" , ";
3074 tmpStack.push( outStr.str() );
3079 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing if operator ");
3081 tmp1 = tmpStack.top();
3083 tmp2 = tmpStack.top();
3085 tmp3 = tmpStack.top();
3087 tmpStack.push(
"if(" + tmp3 +
"," + tmp2 +
"," + tmp1 +
")" );
3092 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing product operator");
3098 productStack.push( tmpStack.top() );
3104 outStr << productStack.top();
3105 if (j < nlnodeProduct->inumberOfChildren - 1) outStr <<
" * ";
3109 tmpStack.push( outStr.str() );
3120 if(tmpStack.size() != 1)
throw ErrorClass(
"There is an error in the OSExpression Tree -- stack size should be 1 at end");
3121 resultString = tmpStack.top();
3125 return resultString;
3135 throw ErrorClass(
"Error in getNonlinearExpressionTreeInInfix, rowIdx not valid");
3137 return resultString;
3150 std::vector<ExprNode*> postfixVec;
3161 throw ErrorClass(
"Error in getNonlinearExpressionTreeModInPostfix, rowIdx not valid");
3176 std::vector<ExprNode*> prefixVec;
3186 throw ErrorClass(
"Error in getNonlinearExpressionTreeInPrefix, rowIdx not valid");
3201 std::vector<ExprNode*> prefixVec;
3211 throw ErrorClass(
"Error in getNonlinearExpressionTreeInPrefix, rowIdx not valid");
3225 std::map<int, int> foundIdx;
3226 std::map<int, int>::iterator pos;
3248 if(foundIdx.find( index) != foundIdx.end() )
3262 foundIdx[ index] = i;
3269 foundIdx[ index] = i;
3275 for(pos = foundIdx.begin(); pos != foundIdx.end(); ++pos)
3306 throw ErrorClass(
"data object undefined in method getMatrixNumber()");
3348 for (
int i=0; i < n; i++)
3352 for (
int j=0; j < nCh; j++)
3386 m_miMatrixNumberOfValues[i] = 0;
3387 m_miMatrixNumberOfBlocks[i] = 0;
3397 throw ErrorClass(
"Illegal reference to baseMatrix while processing matrices");
3400 if (m_mExpandedMatricesInColumnMajor[bm] != NULL)
3401 haveElements =
true;
3402 if (m_mExpandedMatricesInRowMajor[bm] != NULL)
3405 haveElements =
true;
3407 if (m_mMatrixBlocksInColumnMajor != NULL)
3409 if (m_mMatrixTransformation != NULL)
3410 haveTransformation =
true;
3414 == ENUM_MATRIX_CONSTRUCTOR_TYPE_elements)
3416 haveElements =
true;
3420 haveTransformation =
true;
3425 m_miMatrixNumberOfValues[i] =
new int[n];
3426 m_miMatrixNumberOfBlocks[i] =
new int[n];
3446 if ( (n < 0) || (n >= nMatrices) )
return false;
3454 if ( (n < 0) || (n >= nMatrices) )
return false;
3462 if ( (n < 0) || (n >= nMatrices) )
return false;
3470 if ( (n < 0) || (n >= nMatrices) )
return false;
3478 if ( (n < 0) || (n >= nMatrices) )
return false;
3486 if ( (n < 0) || (n >= nMatrices) )
return false;
3494 if ( (n < 0) || (n >= nMatrices) )
return false;
3505 throw ErrorClass(
"no matrices defined in method getMatrixCoefficientsInColumnMajor()");
3506 if ( (n < 0) || (n >= nMatrices) )
3507 throw ErrorClass(
"invalid matrix index in method getMatrixCoefficientsInColumnMajor()");
3523 throw ErrorClass(
"no matrices defined in method getMatrixCoefficientsInRowMajor()");
3524 if ( (n < 0) || (n >= nMatrices) )
3525 throw ErrorClass(
"invalid matrix index in method getMatrixCoefficientsInRowMajor()");
3541 throw ErrorClass(
"data object undefined in method getNumberOfMatrixVariables()");
3556 throw ErrorClass(
"data object undefined in method getNumberOfMatrixObjectives()");
3571 throw ErrorClass(
"data object undefined in method getNumberOfMatrixConstraints()");
3586 throw ErrorClass(
"data object undefined in method getNumberOfMatrixExpressions()");
3605 throw ErrorClass(
"data object undefined in method getNumberOfMatrixExpressions()");
3625 return m_iNumberOfMatrixExpressionTreeIndexes;
3630 if(m_bMatrixExpressionTreeIndexesProcessed ==
true)
return m_miMatrixExpressionTreeIndexes;
3631 m_bMatrixExpressionTreeIndexesProcessed =
true;
3632 std::map<int, MatrixExpressionTree*> expTrees;
3634 std::map<int, MatrixExpressionTree*>::iterator pos;
3638 m_iNumberOfMatrixExpressionTreeIndexes = expTrees.size();
3639 m_miMatrixExpressionTreeIndexes =
new int[ m_iNumberOfMatrixExpressionTreeIndexes ] ;
3641 for(pos = expTrees.begin(); pos != expTrees.end(); ++pos)
3643 m_miMatrixExpressionTreeIndexes[ i++] = pos->first;
3646 return m_miMatrixExpressionTreeIndexes;
3657 if( m_bProcessMatrixExpressionTrees ==
false )
3669 if( m_bProcessMatrixExpressionTreesMod ==
false )
3673 if( m_mapMatrixExpressionTreesMod.find( rowIdx) != m_mapMatrixExpressionTreesMod.end())
3674 return m_mapMatrixExpressionTreesMod[ rowIdx];
3682 std::vector<ExprNode*> postfixVec;
3692 throw ErrorClass(
"Error in getMatrixExpressionTreeInPostfix, rowIdx not valid");
3706 std::string resultString;
3711 ostringstream outStr;
3712 std::vector<ExprNode*> postfixVec;
3713 int rowIdx = rowIdx_;
3721 std::string tmp1 =
"";
3722 std::string tmp2 =
"";
3723 std::string tmp3 =
"";
3724 std::stack<OSnLNode*> opStack;
3725 std::stack<std::string> tmpStack;
3726 std::stack<std::string> sumStack;
3727 std::stack<std::string> productStack;
3728 std::stack<std::string> minStack;
3729 std::stack<std::string> maxStack;
3742 n = postfixVec.size();
3744 for (i = 0 ; i < n; i++)
3746 nlnode = postfixVec[ n - 1 - i];
3747 opStack.push( nlnode);
3753 for(i = 0; i < n; i++)
3756 nlnode = opStack.top();
3766 tmpStack.push(
"PI" );
3770 tmpStack.push(
"E" );
3778 if( (nlnodeVar->
coef > 1.0) || (nlnodeVar->
coef < 1.0) )
3783 outStr << nlnodeVar->
idx;
3785 tmpStack.push(outStr.str() );
3791 outStr << nlnodeVar->
idx;
3792 tmpStack.push(outStr.str() );
3798 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing plus operator");
3799 tmp1 = tmpStack.top();
3801 tmp2 = tmpStack.top();
3803 tmpStack.push(
"(" + tmp2 +
" + " + tmp1 +
")");
3807 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing sum operator");
3813 sumStack.push( tmpStack.top() );
3819 outStr << sumStack.top();
3820 if (j < nlnodeSum->inumberOfChildren - 1) outStr <<
" + ";
3824 tmpStack.push( outStr.str() );
3829 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing minus operator");
3830 tmp1 = tmpStack.top();
3832 tmp2 = tmpStack.top();
3834 tmpStack.push(
"(" + tmp2 +
" - " + tmp1 +
")");
3838 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- -- Problem writing negate operator");
3839 tmp1 = tmpStack.top();
3841 tmpStack.push(
"-"+ tmp1 );
3847 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing times operator");
3848 tmp1 = tmpStack.top();
3850 tmp2 = tmpStack.top();
3852 tmpStack.push(
"(" + tmp2 +
"*" + tmp1 +
")");
3856 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing divide operator");
3857 tmp1 = tmpStack.top();
3859 tmp2 = tmpStack.top();
3861 tmpStack.push(
"(" + tmp2 +
" / " + tmp1 +
")");
3865 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing power operator");
3866 tmp1 = tmpStack.top();
3868 tmp2 = tmpStack.top();
3870 tmpStack.push(
"(" + tmp2 +
" ^ " + tmp1 +
")");
3875 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing abs operator");
3876 tmp1 = tmpStack.top();
3878 tmpStack.push(
"abs( "+ tmp1 +
")");
3882 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing erf operator");
3883 tmp1 = tmpStack.top();
3885 tmpStack.push(
"erf( "+ tmp1 +
")");
3890 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing square operator ");
3891 tmp1 = tmpStack.top();
3893 tmpStack.push(
"("+ tmp1 +
")^2");
3897 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing ln operator");
3898 tmp1 = tmpStack.top();
3900 tmpStack.push(
"ln( "+ tmp1 +
")");
3905 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing exp operator");
3906 tmp1 = tmpStack.top();
3908 tmpStack.push(
"exp( "+ tmp1 +
")");
3912 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing sin operator");
3913 tmp1 = tmpStack.top();
3915 tmpStack.push(
"sin( "+ tmp1 +
")");
3919 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing cos operator ");
3920 tmp1 = tmpStack.top();
3922 tmpStack.push(
"cos( "+ tmp1 +
")");
3926 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing sqrt operator ");
3927 tmp1 = tmpStack.top();
3929 tmpStack.push(
"sqrt( "+ tmp1 +
")");
3933 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing min operator");
3939 minStack.push( tmpStack.top() );
3945 outStr << minStack.top();
3946 if (j < nlnodeMin->inumberOfChildren - 1) outStr <<
" , ";
3950 tmpStack.push( outStr.str() );
3954 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing max operator");
3960 maxStack.push( tmpStack.top() );
3966 outStr << maxStack.top();
3967 if (j < nlnodeMax->inumberOfChildren - 1) outStr <<
" , ";
3971 tmpStack.push( outStr.str() );
3976 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing if operator ");
3978 tmp1 = tmpStack.top();
3980 tmp2 = tmpStack.top();
3982 tmp3 = tmpStack.top();
3984 tmpStack.push(
"if(" + tmp3 +
"," + tmp2 +
"," + tmp1 +
")" );
3988 if( tmpStack.size() < nlnode->
inumberOfChildren)
throw ErrorClass(
"There is an error in the OSExpression Tree -- Problem writing product operator");
3994 productStack.push( tmpStack.top() );
4000 outStr << productStack.top();
4001 if (j < nlnodeProduct->inumberOfChildren - 1) outStr <<
" * ";
4005 tmpStack.push( outStr.str() );
4016 if(tmpStack.size() != 1)
throw ErrorClass(
"There is an error in the OSExpression Tree -- stack size should be 1 at end");
4017 resultString = tmpStack.top();
4021 return resultString;
4031 throw ErrorClass(
"Error in getNonlinearExpressionTreeInInfix, rowIdx not valid");
4033 return resultString;
4046 std::vector<ExprNode*> postfixVec;
4049 if( m_mapMatrixExpressionTreesMod.find( rowIdx) != m_mapMatrixExpressionTreesMod.end())
4057 throw ErrorClass(
"Error in getMatrixExpressionTreeModInPostfix, rowIdx not valid");
4072 std::vector<ExprNode*> prefixVec;
4082 throw ErrorClass(
"Error in getMatrixExpressionTreeInPrefix, rowIdx not valid");
4092std::vector<ExprNode*> OSInstance::getMatrixExpressionTreeModInPrefix(
int rowIdx)
4097 std::vector<ExprNode*> prefixVec;
4100 if( m_mapMatrixExpressionTreesMod.find( rowIdx) != m_mapMatrixExpressionTreesMod.end())
4107 throw ErrorClass(
"Error in getMatrixExpressionTreeInPrefix, rowIdx not valid");
4121 std::map<int, int> foundIdx;
4122 std::map<int, int>::iterator pos;
4147 if(foundIdx.find( index) != foundIdx.end() )
4168 foundIdx[ index] = i;
4175 foundIdx[ index] = i;
4180 for(pos = foundIdx.begin(); pos != foundIdx.end(); ++pos)
4184 m_iMatrixObjectiveNumberNonlinear++;
4188 m_iMatrixConstraintNumberNonlinear++;
4191 m_bProcessMatrixExpressionTrees =
true;
4215 throw ErrorClass(
"getTimeDomainStageNumber: Continuous time not implemented yet");
4322 int timeDomainStageNumberVar;
4360 int numTimeDomainStageCon;
4396 int numTimeDomainStageObjNum;
4472 if(number < 0)
return false;
4503 double *upperBounds,
char *types)
4505 if(number <= 0)
return false;
4510 throw ErrorClass(
"There is no variables object");
4514 throw ErrorClass(
"input number of variables not equal to number in class");
4518 for(i = 0; i < number; i++)
4526 if(lowerBounds != NULL)
4528 for(i = 0; i < number; i++)
4533 if(upperBounds != NULL)
4535 for(i = 0; i < number; i++)
4542 for(i = 0; i < number; i++)
4560 if(number < 0)
return false;
4576 int arrayIndex = abs(index) -1;
4580 if( (maxOrMin !=
"max") && (maxOrMin !=
"min") )
return false;
4584 int n = objectiveCoefficients->
number;
4595 for(i = 0; i < n; i++)
4606 if(number < 0)
return false;
4611 throw ErrorClass(
"there is no objectives object");
4615 throw ErrorClass(
"input number of objective not equal to number in class");
4617 if(number == 0)
return true;
4625 if(maxOrMins != NULL)
4627 for(i = 0; i < number; i++)
4629 if(maxOrMins[i] ==
"" || (maxOrMins[i].compare(
"max") != 0 && maxOrMins[i].compare(
"min") !=0))
return false;
4633 if(constants != NULL)
4641 if(objectiveCoefficients != NULL)
4643 for(i = 0; i < number; i++)
4645 int n = (&objectiveCoefficients[i] == NULL || objectiveCoefficients[i]->
indexes == NULL)?0:objectiveCoefficients[i]->number;
4654 for(j = 0; j < n; j++)
4674 if(number < 0)
return false;
4704 if(number < 0)
return false;
4714 throw ErrorClass(
"there is no constraints object");
4718 throw ErrorClass(
"input number of constraints not equal to number in class");
4721 for(i = 0; i < number; i++)
4729 if(lowerBounds != NULL)
4731 for(i = 0; i < number; i++)
4736 if(upperBounds != NULL)
4738 for(i = 0; i < number; i++)
4743 if(constants != NULL)
4756 double* values,
int valuesBegin,
int valuesEnd,
4757 int* indexes,
int indexesBegin,
int indexesEnd,
4758 int* starts,
int startsBegin,
int startsEnd)
4760 if(numberOfValues < 0)
return false;
4763 if(numberOfValues == 0)
return true;
4764 if((values == 0 ) ||
4765 (valuesBegin < 0 || (valuesEnd - valuesBegin + 1) != numberOfValues) ||
4767 (indexesBegin < 0 || (indexesEnd - indexesBegin + 1) != numberOfValues) ||
4769 (startsBegin < 0 || startsBegin >= startsEnd))
return false;
4821 double* values,
int valuesBegin,
int valuesEnd,
4822 int* indexes,
int indexesBegin,
int indexesEnd,
4823 int* starts,
int startsBegin,
int startsEnd)
4825 if (numberOfValues < 0)
return false;
4828 if (numberOfValues == 0)
return true;
4829 if ((values == 0 ) ||
4830 (valuesBegin < 0 || (valuesEnd - valuesBegin + 1) != numberOfValues) ||
4832 (indexesBegin < 0 || (indexesEnd - indexesBegin + 1) != numberOfValues) ||
4834 (startsBegin < 0 || startsBegin >= startsEnd))
return false;
4847 for(i = startsBegin; i <= startsEnd; i++)
4863 for(i = valuesBegin; i <= valuesEnd; i++)
4880 for(i = indexesBegin; i <= indexesEnd; i++)
4896 for(i = indexesBegin; i <= indexesEnd; i++)
4910 throw ErrorClass(
"number of quadratic terms cannot be negative");
4921 int* rowIndexes,
int* varOneIndexes,
int* varTwoIndexes,
4922 double* coefficients,
int begin,
int end)
4924 if(number < 0)
return false;
4925 if(number != (end - begin) + 1)
return false;
4931 if( (rowIndexes == 0) ||
4932 (varOneIndexes == 0) ||
4933 (varTwoIndexes == 0) ||
4934 (coefficients == 0) )
return false;
4947 for(i = begin; i <= end; i++)
4965 std::vector<ExprNode*> nlNodeVec;
4969 for(i = 0; i < numQPTerms; i++)
4976 nlNodeVariablePoint->
idx = varOneIndexes[ i];
4978 nlNodeVariablePoint->
coef = coefficients[ i];
4979 nlNodeVec.push_back( nlNodeVariablePoint);
4982 nlNodeVariablePoint->
idx = varTwoIndexes[ i];
4983 nlNodeVec.push_back( nlNodeVariablePoint);
4986 nlNodeVec.push_back( (
OSnLNode*)nlNodePoint);
4998 if(nexpr < 0)
return false;
5011 for (
int i=0; i < nexpr; i++)
5017 = (
OSnLNode*)root[i]->osExpressionTree->m_treeRoot->copyNodeAndDescendants();
5024 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
5039 (posMapExpTree->second)->getVariableIndicesMap() ;
5066 "in getJacobianSparsityPattern");
5109 std::ostringstream outStr;
5124 for(i = 0; i < numQTerms; i++)
5131 outStr <<
"PROCESSING QTERM " << i << std::endl;
5153 outStr <<
"ADDED THE FOLLOWING VARIABLE TO THE MAP: " << nlNodeVariableOne->
idx << std::endl;
5166 (*expTree->
mapVarIdx)[ nlNodeVariableTwo->
idx] = k + 1;
5170 outStr <<
"ADDED THE FOLLOWING VARIABLE TO THE MAP" << nlNodeVariableTwo->
idx << std::endl;
5174 nlNodeVariableTwo->
coef = 1.;
5204 nlNodeVariableTwo->
coef = 1.;
5242 if(number < 0)
return false;
5257 unsigned int inumberOfChildren,
MatrixNode **m_mChildren)
5264 matrixType,inumberOfChildren,m_mChildren);
5269 if (number < 0)
return false;
5281 std::string name,
int numberOfOtherIndexes,
int* otherIndexes)
5324 = numberOfOtherIndexes;
5334 std::string name,
int numberOfComponents,
int* components,
5335 int numberOfOtherIndexes,
int* otherIndexes)
5376 std::string name,
int referenceIdx,
int numberOfOtherIndexes,
int* otherIndexes)
5425 std::string name, std::string semidefiniteness,
int numberOfOtherIndexes,
int* otherIndexes)
5448 std::string name,
int distortionMatrixIdx,
double normFactor,
int axisDirection,
5449 int numberOfOtherIndexes,
int* otherIndexes)
5474 std::string name,
int distortionMatrixIdx,
double normFactor,
int firstAxisDirection,
5475 int secondAxisDirection,
int numberOfOtherIndexes,
int* otherIndexes)
5505 std::string name,
int distortionMatrixIdx,
double normFactor,
int axisDirection,
double pNorm,
5506 int numberOfOtherIndexes,
int* otherIndexes)
5534 std::string name,
int maxDegree,
int numberOfUB,
double* ub,
int numberOfLB,
double* lb,
5535 int numberOfOtherIndexes,
int* otherIndexes)
5587 std::string resultString =
"";
5588 ostringstream outStr;
5598 outStr << std::endl;
5600 outStr <<
"Objectives:" << std::endl;
5601 for(i = 0; i < numObj; i++)
5603 outStr << objMaxOrMin[i] <<
' ';
5606 outStr << std::endl;
5607 outStr <<
"Constraints:" << std::endl;
5608 for(i = 0; i < numCon; i++)
5613 outStr << std::endl;
5614 outStr <<
"Variables:" << std::endl;
5616 for(i = 0; i < numVar; i++)
5631 outStr <<
" Type = " ;
5633 outStr <<
" Lower Bound = ";
5635 outStr <<
" Upper Bound = ";
5637 outStr << std::endl;
5648 return outStr.str() ;
5654 std::string resultString =
"";
5657 ostringstream outStr;
5664 bool addedLinearTerm =
false;
5691 for(j = 0; j < row_nonz; j++)
5712 if( j < row_nonz - 1) outStr <<
" + ";
5713 addedLinearTerm =
true;
5719 return "row index not found; print command ignored\n";
5724 int obj_idx = -rowIdx - 1;
5728 for(j = 0; j < obj_nonz; j++)
5734 if( j < obj_nonz - 1) outStr <<
" + ";
5738 return "row index not found; print command ignored\n";
5742 if( (addedLinearTerm ==
true) || (obj_nonz > 0) ) outStr <<
" + " ;
5763 outStr << std::endl;
5764 resultString = outStr.str();
5765 return resultString;
5781 ErrorClass(
"constraint index not valid in OSInstance::calculateFunctionValue");
5805 ErrorClass(
"objective function index not valid in OSInstance::calculateFunctionValue");
5815 for(i = 0; i < obj->
number; i++)
5835 bool new_x,
int highestOrder)
5856 int idx, numConstraints;
5859 for(idx = 0; idx < numConstraints; idx++)
5874 bool new_x,
int highestOrder)
5896 int idx, numObjectives;
5899 for(idx = 0; idx < numObjectives; idx++)
5913 bool new_x,
int highestOrder)
5918 if(highestOrder < 1 )
throw ErrorClass(
"When calling calculateAllConstraintFunctionGradients highestOrder should be 1 or 2");
5932 int idx,
bool new_x,
int highestOrder)
5936 if(highestOrder < 1 )
throw ErrorClass(
"When calling calculateConstraintFunctionGradient highestOrder should be 1 or 2");
5938 throw ErrorClass(
"invalid index passed to calculateConstraintFunctionGrad");
5948 for(i = 0; i < sp->
number; i++)
5967 throw ErrorClass(
"invalid index passed to calculateConstraintFunctionGrad");
5977 for(i = 0; i < sp->
number; i++)
5992 bool new_x,
int highestOrder)
5996 if(highestOrder < 1 )
throw ErrorClass(
"When calling calculateAllObjectiveFunctionGradients highestOrder should be 1 or 2");
5999 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
6002 if(posMapExpTree->first < 0)
6005 posMapExpTree->first, new_x, highestOrder);
6018 int objIdx,
bool new_x,
int highestOrder)
6025 if(highestOrder < 1 )
throw ErrorClass(
"When calling calculateObjectiveFunctionGradient highestOrder should be 1 or 2");
6029 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
6030 std::map<int, int>::iterator posVarIndexMap;
6031 int iHighestOrderEvaluatedStore;
6037 if(posMapExpTree->first == objIdx)
6044 m_vdX.push_back( x[ posVarIndexMap->first]) ;
6086 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
6087 std::map<int, int>::iterator posVarIndexMap;
6089 int iHighestOrderEvaluatedStore;
6093 if(posMapExpTree->first == objIdx)
6100 m_vdX.push_back( x[ posVarIndexMap->first]) ;
6136 bool new_x,
int highestOrder)
6140 if(highestOrder != 2 )
throw ErrorClass(
"When calling calculateLagrangianHessian highestOrder should be 2");
6158 throw ErrorClass(
"invalid index passed to calculateHessian");
6165 objLambda[ i] = 0.0;
6169 conLambda[ i] = 0.0;
6175 objLambda[ abs(idx) - 1] = 1.0;
6179 conLambda[ idx] = 1.0;
6199 std::ostringstream outStr;
6208 double *value = NULL;
6222 for ( i = 0; i < iNumRowStarts; i++)
6235 this->instanceData->linearConstraintCoefficients->
numberOfValues > 0)
6238 for (i = 0; i < iNumVariableStarts; i++)
6240 for (j = start[i]; j < start[ i + 1 ]; j++)
6255 if( value[j] > 0 || value[j] < 0)
6259 nlNodeVariable->
coef = value[ j];
6260 nlNodeVariable->
idx = i;
6279 for (i = 1; i < iNumRowStarts; i++ )
6297 this->instanceData->linearConstraintCoefficients->
numberOfValues > 0)
6301 for (i = 0; i < iNumVariableStarts; i++)
6305 for (j = start[i]; j < start[ i + 1 ]; j++)
6321 std::map<int, int>::iterator posVarIdx;
6323 for (i = 0; i < iNumRowStarts - 1; i++ )
6336 posVarIdx->second = iTemp;
6344 outStr <<
"HERE ARE ROW STARTS:" << std::endl;
6345 for (i = 0; i < iNumRowStarts; i++ )
6349 outStr << std::endl << std::endl;
6350 outStr <<
"HERE ARE VARIABLE INDICES:" << std::endl;
6351 for (i = 0; i <
m_miJacStart[ iNumRowStarts - 1]; i++ )
6355 outStr << std::endl << std::endl;
6356 outStr <<
"HERE ARE VALUES:" << std::endl;
6357 for (i = 0; i <
m_miJacStart[ iNumRowStarts - 1]; i++ )
6361 outStr << std::endl << std::endl;
6363 outStr <<
"HERE ARE NUMBER OF CONSTANT TERMS:" << std::endl;
6364 for (i = 0; i < iNumRowStarts - 1; i++ )
6369 outStr << std::endl << std::endl;
6378 std::ostringstream outStr;
6383 std::map<int, int>::iterator posVarIdx;
6387 double *value = NULL;
6390 this->instanceData->linearConstraintCoefficients->
numberOfValues > 0)
6402 for ( i = 0; i < iNumJacRowStarts; i++)
6417 this->instanceData->linearConstraintCoefficients->
numberOfValues > 0)
6420 for (i = 0; i < loopLimit; i++)
6423 for (j = start[i]; j < start[ i + 1 ]; j++)
6434 if(value[ j] > 0 || value[j] < 0)
6437 nlNodeVariable->
coef = value[ j];
6438 nlNodeVariable->
idx = index[ j];
6455 for (i = 1; i < iNumJacRowStarts; i++ )
6474 this->instanceData->linearConstraintCoefficients->
numberOfValues > 0)
6476 for (i = 0; i < loopLimit; i++)
6479 for (j = start[i]; j < start[ i + 1 ]; j++)
6492 for (i = 0; i < loopLimit; i++ )
6504 posVarIdx->second = k;
6512 outStr <<
"HERE ARE ROW STARTS:" << std::endl;
6513 for (i = 0; i < iNumJacRowStarts; i++ )
6517 outStr << std::endl << std::endl;
6518 outStr <<
"HERE ARE VARIABLE INDICES:" << std::endl;
6519 for (i = 0; i <
m_miJacStart[ iNumJacRowStarts - 1]; i++ )
6523 outStr << std::endl << std::endl;
6524 outStr <<
"HERE ARE VALUES:" << std::endl;
6525 for (i = 0; i <
m_miJacStart[ iNumJacRowStarts - 1]; i++ )
6529 outStr << std::endl << std::endl;
6531 outStr <<
"HERE ARE NUMBER OF CONSTANT TERMS:" << std::endl;
6532 for (i = 0; i < iNumJacRowStarts - 1; i++ )
6536 outStr << std::endl << std::endl;
6549 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
6553 int numChildren = 0;
6567 nlNodeVariable->
coef = 1.;
6570 rowIdx = posMapExpTree->first;
6586 nlNodeSum->
m_mChildren[ numChildren] = nlNodeTimes;
6597 std::ostringstream outStr;
6602 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
6603 std::map<int, int>::iterator posVarIdx;
6609 expTree = posMapExpTree->second;
6611 for(posVarIdx = (*expTree->
mapVarIdx).begin(); posVarIdx != (*expTree->
mapVarIdx).end(); ++posVarIdx)
6625 posVarIdx->second = kount;
6631 outStr <<
"POSITION FIRST = " << posVarIdx->first ;
6632 outStr <<
" POSITION SECOND = " << posVarIdx->second << std::endl;
6643 std::ostringstream outStr;
6654 std::vector<double> vx;
6655 std::map<int, int>::iterator posMap1, posMap2;
6660 vx.push_back( 1.0) ;
6695 outStr <<
"HESSIAN SPARSITY PATTERN" << std::endl;
6729 bool new_x,
int highestOrder)
6734 std::map<int, int>::iterator posVarIndexMap;
6741 m_vdX.push_back( x[ posVarIndexMap->first]) ;
6751 if(
m_vdX.size() == 0)
6755 m_vdX.push_back( x[ posVarIndexMap->first]) ;
6763 switch( highestOrder)
6793 throw ErrorClass(
"Derivative should be order 0, 1, or 2");
6806 std::ostringstream outStr;
6811 int i, j, rowNum, objNum;
6872 std::ostringstream outStr;
6878 int rowNum, jacIndex;
6879 unsigned int jstart, jend;
6883 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
6884 std::map<int, int>::iterator posVarIdx;
6897 idx = posMapExpTree->first;
6908 ErrorClass(
"number of partials not consistent");
6949 idx = posMapExpTree->first;
6974 outStr <<
"JACOBIAN DATA " << std::endl;
6996 std::ostringstream outStr;
7002 int rowNum, jacIndex;
7005 int hessValuesIdx = 0;
7007 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
7008 std::map<int, int>::iterator posVarIndexMap;
7009 if( objLambda == NULL)
throw ErrorClass(
"must have a multiplier for the objective function even if zero when calling getSecondOrderResults");
7011 if( conMultipliers == NULL)
throw ErrorClass(
"cannot have a null vector of lagrange multipliers when calling getSecondOrderResults -- okay if zero");
7015 if( posMapExpTree->first >= 0)
7017 m_vdLambda.push_back( conMultipliers[ posMapExpTree->first]);
7022 m_vdLambda.push_back( objLambda[ abs(posMapExpTree->first) - 1] );
7037 idx = posMapExpTree->first;
7088 outStr <<
"JACOBIAN DATA " << std::endl;
7109 std::ostringstream outStr;
7118 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
7145 std::ostringstream outStr;
7158 for(i = 0; i < m; i++)
7161 for(j = 0; j < n; j++)
7165 outStr <<
"m_mmdObjGradient[i][j] = " <<
m_mmdObjGradient[i][j] << std::endl;
7189 if ((format !=
"stages") && (format !=
"interval") && (format !=
"none"))
7195 if (format ==
"stages")
7206 if (format ==
"interval")
7217 if (format ==
"none")
7280 for (
int i = 0; i < number; i++)
7286 for (
int i = 0; i < number; i++)
7342 for (
int i = 0; i < numberOfStages; i++)
7346 for (
int i = 0; i < numberOfStages; i++)
7357 checksum += numberOfVariables[i];
7384 for (
int i = 0; i < numberOfStages; i++)
7388 for (
int i = 0; i < numberOfStages; i++)
7399 for (
int j = 0; j < numberOfVariables[i]; j++)
7404 checksum += numberOfVariables[i];
7411 for (
int i = 0; i < numberOfStages; i++)
7415 if (checkvar[k] != -1)
7450 for (
int i = 0; i < numberOfStages; i++)
7454 for (
int i = 0; i < numberOfStages; i++)
7465 checksum += numberOfConstraints[i];
7492 for (
int i = 0; i < numberOfStages; i++)
7496 for (
int i = 0; i < numberOfStages; i++)
7507 for (
int j = 0; j < numberOfConstraints[i]; j++)
7512 checksum += numberOfConstraints[i];
7519 for (
int i = 0; i < numberOfStages; i++)
7523 if (checkvar[k] != -1)
7560 for (
int i = 0; i < numberOfStages; i++)
7563 for (
int i = 0; i < numberOfStages; i++)
7601 for (
int i = 0; i < numberOfStages; i++)
7604 for (
int i = 0; i < numberOfStages; i++)
7615 for (
int j = 0; j < numberOfObjectives[i]; j++)
7625 for (
int i = 0; i < numberOfStages; i++)
7632 if (checkvar[i] == 0)
7669 std::map<int, ScalarExpressionTree*>::iterator posMapExpTree;
7671 size_t n = vdX.size();
7672#ifdef COIN_HAS_CPPAD
7674 CppAD::vector< CppAD::AD<double> > vdaX( n );
7675 for(i = 0; i < n; i++)
7680 CppAD::Independent( vdaX);
7686 CppAD::vector< CppAD::AD<double> > m_vFG;
7700 Fad =
new CppAD::ADFun<double>(vdaX, m_vFG);
7705 throw ErrorClass(
"Error: An Algorithmic Differentiation Package Not Available");
7724 ErrorClass(
"trying to calculate a p order forward when p-1 Taylor coefficient not available");
7728#ifdef COIN_HAS_CPPAD
7729 return (*Fad).Forward(p, vdX);
7731 throw ErrorClass(
"Error: An Algorithmic Differentiation Package Not Available");
7746#ifndef COIN_HAS_CPPAD
7747 throw ErrorClass(
"Error: An Algorithmic Differentiation Package Not Available");
7752 ErrorClass(
"trying to calculate a p order reverse when p-1 Taylor coefficient not available");
7754#ifdef COIN_HAS_CPPAD
7755 return (*Fad).Reverse(p, vdlambda);
7783#ifdef COIN_HAS_CPPAD
7786 throw ErrorClass(
"Error: An Algorithmic Differentiation Package Not Available");
7791 std::vector<bool> e( m);
7793 for(i = 0; i < m; i++) e[i] =
true;
7798#ifdef COIN_HAS_CPPAD
7823 ostringstream outStr;
7828 outStr <<
" name=\"" <<
name <<
"\"";
7829 outStr <<
"/>" << std::endl;
7830 return outStr.str();
7835 ostringstream outStr;
7836 outStr <<
"<nonnegativeCone";
7840 outStr <<
" name=\"" <<
name <<
"\"";
7841 outStr <<
"/>" << std::endl;
7842 return outStr.str();
7847 ostringstream outStr;
7848 outStr <<
"<nonpositiveCone";
7852 outStr <<
" name=\"" <<
name <<
"\"";
7853 outStr <<
"/>" << std::endl;
7854 return outStr.str();
7859 ostringstream outStr;
7860 outStr <<
"<generalOrthantCone";
7864 outStr <<
" name=\"" <<
name <<
"\"";
7865 outStr <<
">" << std::endl;
7880 outStr <<
"<direction";
7883 outStr <<
" type=\"zero\"";
7885 outStr <<
" type=\"nonpositive\"";
7887 outStr <<
" type=\"nonnegative\"";
7889 outStr <<
" type=\"free\"";
7891 outStr <<
" mult=\"" <<
mult <<
"\"";
7897 outStr <<
"</generalOrthantCone>" << std::endl;
7898 return outStr.str();
7903 ostringstream outStr;
7904 outStr <<
"<polyhedralCone";
7909 outStr <<
" name=\"" <<
name <<
"\"";
7910 outStr <<
"/>" << std::endl;
7911 return outStr.str();
7916 ostringstream outStr;
7917 outStr <<
"<quadraticCone";
7921 outStr <<
" name=\"" <<
name <<
"\"";
7928 outStr <<
"/>" << std::endl;
7929 return outStr.str();
7934 ostringstream outStr;
7935 outStr <<
"<rotatedQuadraticCone";
7939 outStr <<
" name=\"" <<
name <<
"\"";
7948 outStr <<
"/>" << std::endl;
7949 return outStr.str();
7954 ostringstream outStr;
7955 outStr <<
"<semidefiniteCone";
7960 outStr <<
"/>" << std::endl;
7962 return outStr.str();
7967 ostringstream outStr;
7968 outStr <<
"<nonnegativeCone";
7972 outStr <<
" name=\"" <<
name <<
"\"";
7973 outStr <<
"/>" << std::endl;
7974 return outStr.str();
7979 ostringstream outStr;
7980 outStr <<
"<nonnegativeCone";
7984 outStr <<
" name=\"" <<
name <<
"\"";
7985 outStr <<
"/>" << std::endl;
7986 return outStr.str();
7991 ostringstream outStr;
7992 outStr <<
"<productCone";
7996 outStr <<
" name=\"" <<
name <<
"\"";
7997 outStr <<
">" << std::endl;
7999 outStr <<
"<factors numberOfEl=\"" <<
factors->
numberOfEl <<
"\">" << std::endl;
8001 outStr <<
"</factors>" << std::endl;
8003 outStr <<
"</productCone>" << std::endl;
8004 return outStr.str();
8009 ostringstream outStr;
8010 outStr <<
"<intersectionCone";
8014 outStr <<
" name=\"" <<
name <<
"\"";
8015 outStr <<
">" << std::endl;
8019 outStr <<
"</components>" << std::endl;
8021 outStr <<
"</intersectionCone>" << std::endl;
8022 return outStr.str();
8043 "First object is NULL, second is not");
8054 "Second object is NULL, first is not");
8084 "First object is NULL, second is not");
8095 "Second object is NULL, first is not");
8139 "First object is NULL, second is not");
8150 "Second object is NULL, first is not");
8180 "First object is NULL, second is not");
8191 "Second object is NULL, first is not");
8197 if (this->
lb != that->
lb)
8199 if (this->
ub != that->
ub)
8201 if (this->type != that->
type)
8203 if (this->name != that->
name)
8224 "First object is NULL, second is not");
8235 "Second object is NULL, first is not");
8265 "First object is NULL, second is not");
8276 "Second object is NULL, first is not");
8282 if (this->name != that->
name)
8284 if (this->maxOrMin != that->
maxOrMin)
8286 if (this->constant != that->
constant)
8315 "First object is NULL, second is not");
8326 "Second object is NULL, first is not");
8332 if (this->
idx != that->
idx)
8355 "First object is NULL, second is not");
8366 "Second object is NULL, first is not");
8396 "First object is NULL, second is not");
8407 "Second object is NULL, first is not");
8413 if (this->name != that->
name)
8415 if (this->constant != that->
constant)
8417 if (this->
lb != that->
lb)
8419 if (this->
ub != that->
ub)
8441 "First object is NULL, second is not");
8452 "Second object is NULL, first is not");
8463 if (!this->rowIdx->IsEqual(that->
rowIdx))
8488 "First object is NULL, second is not");
8500 "Second object is NULL, first is not");
8532 "First object is NULL, second is not");
8543 "Second object is NULL, first is not");
8549 if (this->
idx != that->
idx)
8576 "First object is NULL, second is not");
8587 "Second object is NULL, first is not");
8619 "First object is NULL, second is not");
8630 "Second object is NULL, first is not");
8636 if (this->
idx != that->
idx)
8659 "First object is NULL, second is not");
8670 "Second object is NULL, first is not");
8700 "First object is NULL, second is not");
8711 "Second object is NULL, first is not");
8741 "First object is NULL, second is not");
8752 "Second object is NULL, first is not");
8787 "First object is NULL, second is not");
8798 "Second object is NULL, first is not");
8826 "First object is NULL, second is not");
8837 "Second object is NULL, first is not");
8870 "First object is NULL, second is not");
8881 "Second object is NULL, first is not");
8914 "First object is NULL, second is not");
8925 "Second object is NULL, first is not");
8952 "First object is NULL, second is not");
8963 "Second object is NULL, first is not");
8990 "First object is NULL, second is not");
9001 "Second object is NULL, first is not");
9028 "First object is NULL, second is not");
9039 "Second object is NULL, first is not");
9068 "First object is NULL, second is not");
9079 "Second object is NULL, first is not");
9108 "First object is NULL, second is not");
9119 "Second object is NULL, first is not");
9186 "First object is NULL, second is not");
9197 "Second object is NULL, first is not");
9212 if (that->
matrixVar[i] != NULL)
return false;
9234 "First object is NULL, second is not");
9245 "Second object is NULL, first is not");
9267 if (this->name != that->
name)
9291 "First object is NULL, second is not");
9302 "Second object is NULL, first is not");
9317 if (that->
matrixObj[i] != NULL)
return false;
9340 "First object is NULL, second is not");
9352 "Second object is NULL, first is not");
9370 if (this->name != that->
name)
9392 "First object is NULL, second is not");
9403 "Second object is NULL, first is not");
9418 if (that->
matrixCon[i] != NULL)
return false;
9440 "First object is NULL, second is not");
9451 "Second object is NULL, first is not");
9473 if (this->name != that->
name)
9495 "First object is NULL, second is not");
9506 "Second object is NULL, first is not");
9516 if (this->
expr[i] != NULL)
9521 if (that->
expr[i] != NULL)
return false;
9543 "First object is NULL, second is not");
9554 "Second object is NULL, first is not");
9560 if (this->
idx != that->
idx )
return false;
9561 if (this->
shape != that->
shape)
return false;
const OSSmartPtr< OSOutput > osoutput
bool OSIsEqual(double x, double y)
std::string os_dtoa_format(double x)
double OSNaN()
returns the value for NaN used in OS
static Bigint * mult(Bigint *a, Bigint *b)
std::string writeIntVectorData(IntVector *v, bool addWhiteSpace, bool writeBase64)
Take an IntVector object and write a string that validates against the OSgL schema.
a data structure to represent a point of departure for constructing a matrix by modifying parts of a ...
The CompletelyPositiveMatricesCone Class.
virtual std::string getConeInXML()
Write a CompletelyPositiveMatricesCone object in XML format.
~CompletelyPositiveMatricesCone()
default destructor.
CompletelyPositiveMatricesCone()
default constructor.
virtual std::string getConeName()
The in-memory representation of a generic cone Specific cone types are derived from this generic clas...
int numberOfOtherIndexes
Cones can also be formed by Multidimensional tensors.
std::string name
The cone can have a name for easier identification.
virtual ~Cone()
The Cone class destructor.
virtual std::string getConeName()
bool IsEqual(Cone *that)
A function to check for the equality of two objects.
ENUM_CONE_TYPE coneType
The type of the cone.
virtual std::string getConeInXML()=0
Write a Cone object in XML format.
int numberOfRows
Every cone has (at least) two dimensions; no distinction is made between vector cones and matrix cone...
Cone()
The Cone class constructor.
The in-memory representation of the <cones> element.
~Cones()
The Cones class destructor.
Cone ** cone
cone is pointer to an array of Cone object pointers
bool IsEqual(Cones *that)
A function to check for the equality of two objects.
Cones()
The Cones class constructor.
int numberOfCones
numberOfCones is the number of <nl> elements in the <cones> element.
The in-memory representation of the <con> element.
double constant
constant is a value that is added to the constraint
double ub
ub is the upper bound on the constraint
bool IsEqual(Constraint *that)
A function to check for the equality of two objects.
double lb
lb is the lower bound on the constraint
Constraint()
The Constraint class constructor.
~Constraint()
The Constraint class destructor.
std::string name
name is the name of the constraint
The in-memory representation of the <constraints> element.
int numberOfConstraints
numberOfConstraints is the number of constraints in the instance
Constraint ** con
con is pointer to an array of Constraint object pointers
~Constraints()
The Constraints class destructor.
Constraints()
The Constraints class constructor.
bool IsEqual(Constraints *that)
A function to check for the equality of two objects.
The CopositiveMatricesCone Class.
virtual std::string getConeInXML()
Write a CopositiveMatricesCone object in XML format.
CopositiveMatricesCone()
default constructor.
~CopositiveMatricesCone()
default destructor.
virtual std::string getConeName()
a double vector data structure
bool IsEqual(DoubleVector *that)
The in-memory representation of a dual cone.
int referenceConeIdx
Dual cones use a reference to another, previously defined cone.
virtual std::string getConeName()
~DualCone()
The DualCone class destructor.
bool IsEqual(DualCone *that)
A function to check for the equality of two objects.
DualCone()
The DualCone class constructor.
used for throwing exceptions.
std::string errormsg
errormsg is the error that is causing the exception to be thrown
A generic class from which we derive both OSnLNode and OSnLMNode.
OSnLNode ** m_mChildren
m_mChildren holds all the operands, that is, nodes that the current node operates on.
int inodeInt
inodeInt is the unique integer assigned to the OSnLNode or OSnLMNode in OSParameters....
unsigned int inumberOfChildren
inumberOfChildren is the number of OSnLNode child elements If this number is not fixed,...
virtual std::string getTokenName()=0
a sparse matrix data structure for matrices that can hold nonconstant values
The in-memory representation of the <instanceData> element.
Variables * variables
variables is a pointer to a Variables object
QuadraticCoefficients * quadraticCoefficients
quadraticCoefficients is a pointer to a QuadraticCoefficients object
Constraints * constraints
constraints is a pointer to a Constraints object
Cones * cones
cones is a pointer to a Cones object
NonlinearExpressions * nonlinearExpressions
nonlinearExpressions is a pointer to a NonlinearExpressions object
MatrixProgramming * matrixProgramming
matrixProgramming is a pointer to a MatrixProgramming object
TimeDomain * timeDomain
timeDomain is a pointer to a TimeDomain object
bool IsEqual(InstanceData *that)
A function to check for the equality of two objects.
InstanceData()
The InstanceData class constructor.
Matrices * matrices
matrices is a pointer to a Matrices object
~InstanceData()
The InstanceData class destructor.
Objectives * objectives
objectives is a pointer to a Objectives object
LinearConstraintCoefficients * linearConstraintCoefficients
linearConstraintCoefficients is a pointer to a LinearConstraintCoefficients object
an integer Vector data structure
bool IsEqual(IntVector *that)
A method to compare two invectors.
The in-memory representation of an intersection cone.
~IntersectionCone()
The IntersectionCone class destructor.
virtual std::string getConeInXML()
Write an IntersectionCone object in XML format.
IntersectionCone()
The IntersectionCone class constructor.
bool IsEqual(IntersectionCone *that)
A function to check for the equality of two objects.
virtual std::string getConeName()
IntVector * components
the list of components contributing to the intersection each component contains a reference to a prev...
int numberOfRows
Every cone has (at least) two dimensions; no distinction is made between vector cones and matrix cone...
The in-memory representation of the <linearConstraintCoefficients> element.
DoubleVector * value
a pointer to the array of nonzero values being stored
int iNumberOfStartElements
iNumberOfStartElements counts the number of elements in the <start> section of <linearConstraintCoeff...
int numberOfValues
numberOfValues is the number of nonzero elements stored in the <linearConstraintCoefficients> element
IntVector * start
a pointer to the start of each row or column stored in sparse format
~LinearConstraintCoefficients()
The LinearConstraintCoefficients class destructor.
bool IsEqual(LinearConstraintCoefficients *that)
A function to check for the equality of two objects.
IntVector * rowIdx
a pointer of row indices if the problem is stored by column
LinearConstraintCoefficients()
The LinearConstraintCoefficients class constructor.
IntVector * colIdx
a pointer of column indices if the problem is stored by row
static SparseMatrix * convertLinearConstraintCoefficientMatrixToTheOtherMajor(bool isColumnMajor, int startSize, int valueSize, int *start, int *index, double *value, int dimension)
Round a double number to the precision specified.
The in-memory representation of the <matrices> element.
bool IsEqual(Matrices *that)
A function to check for the equality of two objects.
~Matrices()
The Matrices class destructor.
int numberOfMatrices
numberOfMatrices is the number of <nl> elements in the <matrices> element.
OSMatrix ** matrix
matrix is a pointer to an array of OSMatrix object pointers
Matrices()
The Matrices class constructor.
The in-memory representation of the <matrixCon> element.
MatrixCon()
The MatrixCon class constructor.
int numberOfColumns
numberOfColumns gives the number of columns of this matrix
~MatrixCon()
The MatrixCon class destructor.
std::string name
an optional name to this MatrixCon
int lbConeIdx
lbConeIdx gives a cone that must contain matrixCon - lbMatrix
int ubConeIdx
ubConeIdx gives a cone that must contain ubMatrix - matrixCon
int lbMatrixIdx
lbMatrixIdx gives a lower bound for this matrixCon
int numberOfRows
numberOfRows gives the number of rows of this matrix
int templateMatrixIdx
templateMatrixIdx refers to a matrix that describes the locations in this matrixVar that are allowed ...
bool IsEqual(MatrixCon *that)
A function to check for the equality of two objects.
int conReferenceMatrixIdx
conReferenceMatrixIdx allows some or all of the components of this matrixCon to be copied from constr...
int ubMatrixIdx
ubMatrixIdx gives an upper bound for this matrixCon
The in-memory representation of the <matrixConstraints> element.
~MatrixConstraints()
The MatrixConstraints class destructor.
int numberOfMatrixCon
numberOfMatrixCon gives the number of <matrixCon> children
bool IsEqual(MatrixConstraints *that)
A function to check for the equality of two objects.
MatrixConstraints()
The MatrixConstraints class constructor.
MatrixCon ** matrixCon
matrixCon is an array of pointers to the <matrixCon> children
The in-memory representation of the <expr> element, which is like a nonlinear expression,...
int idx
idx holds the row index of the nonlinear expression
bool IsEqual(MatrixExpression *that)
A function to check for the equality of two objects.
MatrixExpressionTree * matrixExpressionTree
matrixExpressionTree contains the root of the MatrixExpressionTree
~MatrixExpression()
The MatrixExpression class destructor.
bool m_bDeleteExpressionTree
if m_bDeleteExpressionTree is true during garbage collection, we should delete the osExpression tree ...
MatrixExpression()
The MatrixExpression class constructor.
ENUM_NL_EXPR_SHAPE shape
shape holds the shape of the nonlinear expression (linear/quadratic/convex/general) (see further up i...
Used to hold the instance in memory.
bool IsEqual(MatrixExpressionTree *that)
A function to check for the equality of two objects.
OSnLMNode * m_treeRoot
m_treeRoot holds the root node (of OSnLMNode type) of the expression tree.
The in-memory representation of the <matrixExpressions> element.
int numberOfExpr
numberOfExpr gives the number of expressions
bool IsEqual(MatrixExpressions *that)
A function to check for the equality of two objects.
MatrixExpressions()
The MatrixExpressions class constructor.
MatrixExpression ** expr
a pointer to an array of linear and nonlinear expressions that evaluate to matrices
~MatrixExpressions()
The MatrixExpressions class destructor.
a generic class from which we derive matrix constructors (BaseMatrix, MatrixElements,...
unsigned int inumberOfChildren
inumberOfChildren is the number of MatrixNode child elements For the matrix types (OSMatrix and Matri...
MatrixNode ** m_mChildren
m_mChildren holds all the children, that is, nodes used in the definition or construction of the curr...
ENUM_MATRIX_CONSTRUCTOR_TYPE nType
nType is a unique integer assigned to each type of matrix node (see OSParameters.h)
The in-memory representation of the <matrixObj> element.
int numberOfColumns
numberOfColumns gives the number of columns of this matrix
int numberOfRows
numberOfRows gives the number of rows of this matrix
bool IsEqual(MatrixObj *that)
A function to check for the equality of two objects.
int orderConeIdx
orderConeIdx gives a cone that expresses preferences during the optimization x is (weakly) preferred ...
MatrixObj()
The MatrixVar class constructor.
int constantMatrixIdx
constantMatrixIdx gives a constant added to the matrixObj
~MatrixObj()
The MatrixVar class destructor.
int templateMatrixIdx
templateMatrixIdx refers to a matrix that describes the locations in this matrixObj that are allowed ...
std::string name
an optional name to this matrixObj
int objReferenceMatrixIdx
objReferenceMatrixIdx allows some or all of the components of this matrixObj to be copied from object...
The in-memory representation of the <matrixObjectives> element.
~MatrixObjectives()
The MatrixObjectives class destructor.
bool IsEqual(MatrixObjectives *that)
A function to check for the equality of two objects.
MatrixObjectives()
The MatrixObjectives class constructor.
int numberOfMatrixObj
numberOfMatrixObj gives the number of <matrixObj> children
MatrixObj ** matrixObj
matrixObj is an array of pointers to the <matrixObj> children
The in-memory representation of the <matrixProgramming> element.
MatrixObjectives * matrixObjectives
a pointer to the matrixObjectives object
~MatrixProgramming()
The MatrixProgramming class destructor.
MatrixProgramming()
The MatrixProgramming class constructor.
MatrixConstraints * matrixConstraints
a pointer to the matrixConstraints object
bool IsEqual(MatrixProgramming *that)
A function to check for the equality of two objects.
MatrixExpressions * matrixExpressions
a pointer to the matrixExpressions object
MatrixVariables * matrixVariables
a pointer to the matrixVariables object
int getNumberOfElementConstructors()
ENUM_MATRIX_SYMMETRY symmetry
To track the type of symmetry present in the matrix or block.
bool matrixHasTransformations()
GeneralSparseMatrix * getMatrixCoefficientsInColumnMajor()
int getNumberOfTransformationConstructors()
bool matrixHasBase()
Several tools to parse the constructor list of a matrix.
GeneralSparseMatrix * getMatrixCoefficientsInRowMajor()
int getNumberOfBlocksConstructors()
The in-memory representation of the <matrixVar> element.
int ubConeIdx
ubConeIdx gives a cone that must contain ubMatrix - matrixVar
bool IsEqual(MatrixVar *that)
A function to check for the equality of two objects.
char varType
an optional variable type (C, B, I, D, J, S).
int lbMatrixIdx
lbMatrixIdx gives a lower bound for this matrixVar
~MatrixVar()
The MatrixVar class destructor.
std::string name
an optional name to this matrixVar
int lbConeIdx
lbConeIdx gives a cone that must contain matrixVar - lbMatrix
int numberOfRows
numberOfRows gives the number of rows of this matrix
int varReferenceMatrixIdx
varReferenceMatrixIdx allows some or all of the components of this matrix variable to be copied from ...
int numberOfColumns
numberOfColumns gives the number of columns of this matrix
MatrixVar()
The MatrixVar class constructor.
int ubMatrixIdx
ubMatrixIdx gives an upper bound for this matrixVar
int templateMatrixIdx
templateMatrixIdx refers to a matrix that describes the locations in this matrixVar that are allowed ...
The in-memory representation of the <matrixVariables> element.
MatrixVariables()
The MatrixVariables class constructor.
MatrixVar ** matrixVar
matrixVar is an array of pointers to the <matrixVar> children
bool IsEqual(MatrixVariables *that)
A function to check for the equality of two objects.
~MatrixVariables()
The MatrixVariables class destructor.
int numberOfMatrixVar
numberOfMatrixVar gives the number of <matrixVar> children
The in-memory representation of the <nl> element.
int idx
idx holds the row index of the nonlinear expression
ScalarExpressionTree * osExpressionTree
osExpressionTree contains the root of the ScalarExpressionTree
ENUM_NL_EXPR_SHAPE shape
shape holds the shape of the nonlinear expression (linear/quadratic/convex/general) (see further up i...
bool IsEqual(Nl *that)
A function to check for the equality of two objects.
bool m_bDeleteExpressionTree
m_bDeleteExpressionTree is true, if in garbage collection, we should delete the osExpression tree obj...
The in-memory representation of the <nonlinearExpressions> element.
~NonlinearExpressions()
The NonlinearExpressions class destructor.
int numberOfNonlinearExpressions
numberOfNonlinearExpressions is the number of <nl> elements in the <nonlinearExpressions> element.
Nl ** nl
nl is pointer to an array of Nl object pointers
NonlinearExpressions()
The NonlinearExpressions class constructor.
bool IsEqual(NonlinearExpressions *that)
A function to check for the equality of two objects.
The NonnegativeCone Class.
virtual std::string getConeInXML()
Write a NonnegativeCone object in XML format.
virtual std::string getConeName()
NonnegativeCone()
default constructor.
~NonnegativeCone()
default destructor.
The NonpositiveCone Class.
virtual std::string getConeInXML()
Write a NonpositiveCone object in XML format.
virtual std::string getConeName()
~NonpositiveCone()
default destructor.
NonpositiveCone()
default constructor.
bool bDestroyNlNodes
m_bDestroyNlNodes is true if the destructor deletes the nodes in the Expression tree
bool m_bIndexMapGenerated
Retrieve a map of the indices of the variables that are in the expression tree.
std::map< int, int > * mapVarIdx
m_mapVarIdx is a map used to generate the infix expression for AD the key is idx,...
The in-memory representation of an OSiL instance..
bool m_bProcessLinearConstraintCoefficients
----— data items for linear constraint coefficients ----—
bool m_bAllNonlinearVariablesIndex
m_bAllNonlinearVariablesIndexMap is true if the map of the variables in the Lagrangian function has b...
SparseJacobianMatrix * calculateAllConstraintFunctionGradients(double *x, double *objLambda, double *conLambda, bool new_x, int highestOrder)
Calculate the gradient of all constraint functions.
std::vector< ExprNode * > getMatrixExpressionTreeInPostfix(int rowIdx)
Get the postfix tokens for a given row index.
int * m_miQuadRowIndexes
m_miQuadRowIndexes is an integer pointer to the distinct row indexes with a quadratic term.
bool getIterateResults(double *x, double *objLambda, double *conLambda, bool new_x, int highestOrder)
end revised AD code
bool m_bSparseJacobianCalculated
m_bSparseJacobianCalculated is true if getJacobianSparsityPattern() has been called.
std::string m_sInstanceCreator
m_sInstanceSource holds the instance source.
int * m_miMatrixNumberOfColumns
m_miMatrixNumberOfColumns holds the number of columns for each matrix.
bool m_bQTermsAdded
m_bQTermsAdded is true if we added the quadratic terms to the expression tree
double * getObjectiveWeights()
Get objective weights.
ScalarExpressionTree * getLagrangianExpTree()
bool m_bProcessExpressionTrees
m_bProcessExpressionTrees is true if the expression trees have been processed.
std::vector< double > m_vdYjacval
m_vdYval is a vector equal to a column or row of the Jacobian
bool setTimeDomain(std::string format)
This sets the format of the time domain ("stages"/"interval"/"none")
int m_iNumberOfBinaryVariables
m_iNumberOfBinaryVariables holds the number of binary variables.
bool m_bProcessExpressionTreesMod
m_bProcessExpressionTreesMod is true if the modified expression trees have been processed.
std::string getTimeDomainFormat()
Get the format of the time domain ("stages"/"interval")
int ** getTimeDomainStageVarList()
Get the list of variables in each stage.
SparseVector ** m_mObjectiveCoefficients
m_mObjectiveCoefficients holds an array of objective coefficients, one set of objective coefficients ...
std::vector< double > m_vdYval
m_vdYval is a vector of function values
bool m_bProcessObjectives
----— data items for Objectives ----—
bool m_bProcessMatrices
----— data items for matrices ----—
bool processMatrices()
process matrices.
double * getConstraintLowerBounds()
Get constraint lower bounds.
int getNumberOfQuadraticTerms()
Get the number of specified (usually nonzero) qTerms in the quadratic coefficients.
int m_iNumberOfSemiContinuousVariables
m_iNumberOfSemiContinuousVariables holds the number of semi-continuous variables.
bool setInstanceLicence(std::string licence)
set the instance licence.
ENUM_MATRIX_SYMMETRY * m_miMatrixSymmetry
m_miMatrixSymmetry holds the symmetry property of each matrix.
MatrixExpression ** getMatrixExpressions()
Get the pointers to the roots of all matrix expression trees.
bool copyLinearConstraintCoefficients(int numberOfValues, bool isColumnMajor, double *values, int valuesBegin, int valuesEnd, int *indexes, int indexesBegin, int indexesEnd, int *starts, int startsBegin, int startsEnd)
copy linear constraint coefficients: perform a deep copy of the sparse matrix
std::string m_sInstanceLicence
m_sInstanceDescription holds the instance fileCreator info.
double * getVariableUpperBounds()
Get variable upper bounds.
bool setConstraintNumber(int number)
set the number of constraints.
int ** m_mmiTimeDomainStageObjList
m_mmiTimeDomainStageObjList holds the list of objectives in each stage.
double * m_mdObjectiveConstants
m_mdObjectiveConstants holds an array of objective constants (default = 0.0).
bool setTimeDomainStages(int number, std::string *names)
This sets the number (and optionally names) of the time stages.
std::vector< double > m_vdDomainUnitVec
m_vdDomainUnitVec is a unit vector in the domain space
bool matrixHasBase(int n)
Several tools to parse the constructor list of a matrix.
std::string m_sTimeDomainFormat
m_sTimeDomainFormat holds the format ("stages"/"interval") of the time domain.
bool bVariablesModified
bVariablesModified is true if the variables data has been modified.
int m_iVariableNumber
m_iVariableNumber holds the variable number.
int m_iHighestTaylorCoeffOrder
m_iHighestTaylorCoeffOrder is the order of highest calculated Taylor coefficient
std::vector< bool > m_vbLagHessNonz
m_vbLagHessNonz is a boolean vector holding the nonzero pattern of the Lagrangian of the Hessian
bool setInstanceCreator(std::string fileCreator)
set the instance creator.
int * m_miNonlinearExpressionTreeIndexes
m_miNonlinearExpressionTreeIndexes is an integer pointer to the distinct rows indexes in the nonlinea...
SparseJacobianMatrix * getJacobianSparsityPattern()
std::vector< double > forwardAD(int p, std::vector< double > vdX)
Perform an AD forward sweep.
bool matrixHasTransformations(int n)
double * m_mdObjectiveWeights
m_mdObjectiveWeights holds an array of objective weights (default = 1.0).
int getNumberOfBlocksConstructors(int n)
double * m_mdConstraintFunctionValues
m_mdConstraintFunctionValues holds a double array of constraint function values – the size of the arr...
bool bObjectivesModified
bObjectivesModified is true if the objective function data has been modified.
int m_iConstraintNumberNonlinear
m_iConstraintNumberNonlinear is the number of constraints that have a nonlinear term.
int * m_miJacStart
m_miJacStart holds a int array of starts for the Jacobian matrix in sparse form (row major).
int getADSparsityHessian()
end revised AD code
unsigned int m_iNumberOfNonlinearVariables
m_iNumberOfNonlinearVariables is the number of variables that appear in a nonlinear expression.
std::vector< double > m_vdRangeUnitVec
m_vdRangeUnitVec is a unit vector in the range space
bool addQTermsToExressionTree()
bool m_bNonlinearExpressionTreeIndexesProcessed
m_bNonlinearExpressionTreeIndexesProcessed is true if getNonlinearExpressionTreeIndexes() has been ca...
bool addVariable(int index, std::string name, double lowerBound, double upperBound, char type)
add a variable.
bool bAMatrixModified
bAMatrixModified is true if the A matrix data has been modified.
bool setTimeDomainStageConstraintsUnordered(int numberOfStages, int *numberOfConstraints, int **conIndex)
This sets the constraints associated with each time domain stage in srbitrary order.
int m_iMatrixVarNumber
----— data items for matrix programming ----—
std::string printModel()
Print the infix representation of the problem.
int getNumberOfNonlinearExpressionTreeIndexes()
Get the number of unique nonlinear expression tree indexes.
int m_iQuadraticTermNumber
m_iQuadraticTermNumber holds the number of specified (usually nonzero) qTerms in the quadratic coeffi...
int ** m_mmiTimeDomainStageConList
m_mmiTimeDomainStageConList holds the list of constraints in each stage.
std::vector< double > m_vdw
m_vdYval is a vector of derivatives – output from a reverse sweep
int getNumberOfNonlinearExpressionTreeModIndexes()
Get the number of unique nonlinear expression tree indexes after modifying the expression tree to con...
bool getZeroOrderResults(double *x, double *objLambda, double *conLambda)
Calculate function values.
int m_iMatrixNumber
m_iMatrixNumber holds the number of matrices
bool m_bProcessQuadraticTerms
m_bProcessQuadraticTerms holds whether the quadratic terms are processed.
std::string * m_msVariableNames
m_msVariableNames holds an array of variable names.
int getTimeDomainStageNumber()
Get the number of stages that make up the time domain.
int getNumberOfIntegerVariables()
getNumberOfIntegerVariables
bool getSparseJacobianFromColumnMajor()
bool processConstraints()
process constraints.
OSMatrix ** m_mMatrix
m_mMatrix holds the list of constructors for each matrix.
bool bUseExpTreeForFunEval
bUseExpTreeForFunEval is set to true if you wish to use the OS Expression Tree for function evaluatio...
bool setNumberOfQuadraticTerms(int nq)
set the number of quadratic terms
int * m_miTimeDomainStageVariableNumber
m_miTimeDomainStageVariableNumber holds the number of variables in each stage.
bool m_bNonlinearExpressionTreeModIndexesProcessed
m_bNonlinearExpressionTreeModIndexesProcessed is true if getNonlinearExpressionTreeModIndexes has bee...
int * getTimeDomainStageNumberOfObjectives()
Get the number of objectives contained in each time stage.
bool setConeNumber(int number)
set the number of cones
bool m_bQuadraticRowIndexesProcessed
m_bQuadraticRowIndexesProcessed is true if getQuadraticRowIndexes() has been called.
bool getFirstOrderResults(double *x, double *objLambda, double *conLambda)
Calculate first derivatives.
bool addConstraint(int index, std::string name, double lowerBound, double upperBound, double constant)
add a constraint.
double getTimeDomainIntervalHorizon()
Get the horizon for the time domain interval.
int getNumberOfBinaryVariables()
getNumberOfBinaryVariables
int * m_miNonlinearExpressionTreeModIndexes
m_miNonlinearExpressionTreeModIndexes is an integer pointer to the distinct rows indexes in the modif...
int getNumberOfNonlinearObjectives()
bool setQuadraticTermsInNonlinearExpressions(int number, int *rowIndexes, int *varOneIndexes, int *varTwoIndexes, double *coefficients)
set quadratic terms in nonlinearExpressions
bool setNonlinearExpressions(int nexpr, Nl **root)
set nonlinear expressions
bool matrixHasElements(int n)
int * m_miTimeDomainStageObjectiveNumber
m_miTimeDomainStageObjectiveNumber holds the number of objectives in each stage.
bool getLinearConstraintCoefficientMajor()
Get whether the constraint coefficients is in column major (true) or row major (false).
int m_iObjectiveNumberNonlinear
m_iObjectiveNumber is the number of objective functions with a nonlinear term.
int m_iNumberOfTimeStages
m_iNumberOfTimeStages holds the number of discrete stages
std::string getInstanceDescription()
Get instance description.
std::string getInstanceSource()
Get instance source.
std::vector< ExprNode * > getNonlinearExpressionTreeInPrefix(int rowIdx)
Get the prefix tokens for a given row index.
int * m_miNumberOfObjCoef
m_miNumberOfObjCoef holds an integer array of number of objective coefficients (default = 0).
bool addCone(int index, int numberOfRows, int numberOfColumns, ENUM_CONE_TYPE coneType, std::string name, int numberOfOtherIndexes=0, int *otherIndexes=NULL)
add a cone.
std::map< int, ScalarExpressionTree * > getAllNonlinearExpressionTrees()
std::vector< ExprNode * > getNonlinearExpressionTreeModInPostfix(int rowIdx)
Get the postfix tokens for a given row index for the modified Expression Tree (quadratic terms added)...
bool m_bNonLinearStructuresInitialized
m_bNonLinearStructuresInitialized is true if initializeNonLinearStructures() has been called.
ScalarExpressionTree * getNonlinearExpressionTreeMod(int rowIdx)
Get the expression tree for a given row index for the modified expression trees (quadratic terms adde...
bool m_bLagrangianExpTreeCreated
m_bLagrangianHessionCreated is true if a Lagrangian function for the Hessian has been created
bool initObjGradients()
This should be called by initForAlgDiff()
double * m_mdObjectiveFunctionValues
m_mdObjectiveFunctionValues holds a double array of objective function values – the size of the array...
double * m_mdConstraintUpperBounds
m_mdConstraintUpperBounds holds an array of constraint upper bounds (default = INF).
std::string * m_msObjectiveNames
m_msObjectiveNames holds an array of objective names.
int * m_miJacNumConTerms
m_miJacNumConTerms holds a int array of the number of constant terms (gradient does not change) for t...
int getNumberOfMatrixVariables()
Get the number of matrix variables.
int m_iNonlinearExpressionNumber
m_iNonlinearExpressionNumber holds the number of nonlinear expressions.
int getConstraintNumber()
Get number of constraints.
int m_iLinearConstraintCoefficientNumber
m_iLinearConstraintCoefficientNumber holds the number of specified (usually nonzero) linear constrain...
GeneralSparseMatrix * getMatrixCoefficientsInColumnMajor(int n)
Get the (nonzero) elements of the matrix in column major form.
bool setQuadraticCoefficients(int number, int *rowIndexes, int *varOneIndexes, int *varTwoIndexes, double *coefficients, int begin, int end)
set quadratic coefficients into the QuadraticCoefficients->qTerm data structure
int getNumberOfMatrixExpressionTreeIndexes()
Get the number of unique matrix expression tree indexes.
int * getObjectiveCoefficientNumbers()
Get objective coefficient number.
std::map< int, ScalarExpressionTree * > m_mapExpressionTrees
m_mapExpressionTrees holds a hash map of scalar-valued expression tree pointers.
int m_iMatrixExpressionNumber
m_iMatrixExpressionNumber holds the number of matrix expressions
double * getConstraintConstants()
Get constraint constants.
double * calculateAllConstraintFunctionValues(double *x, double *objLambda, double *conLambda, bool new_x, int highestOrder)
Calculate all of the constraint function values.
int * getTimeDomainStageNumberOfVariables()
Get the number of variables contained in each time stage.
std::string * m_msMaxOrMins
m_msMaxOrMins holds a std::string array of objective maxOrMins ("max" or "min").
int getNumberOfStringVariables()
getNumberOfStringVariables
char * m_mcConstraintTypes
m_mcConstraintTypes holds a char array of constraint types (R for range; L for <=; G for >=; E for =;...
double * m_mdVariableUpperBounds
m_mdVariableUpperBounds holds a double array of variable upper bounds (default = INF).
int m_iNumberOfQuadraticRowIndexes
----— data items for quadratic coefficients ----—
std::map< int, int > m_mapOSADFunRangeIndex
m_mapOSADFunRangeIndex is an inverse of the previous map.
bool bConstraintsModified
bConstraintsModified is true if the constraints data has been modified.
std::map< int, MatrixExpressionTree * > getAllMatrixExpressionTrees()
int getLinearConstraintCoefficientNumber()
Get number of specified (usually nonzero) linear constraint coefficient values.
int getNumberOfSemiIntegerVariables()
getNumberOfSemiIntegerVariables
double * m_mdVariableLowerBounds
m_mdVariableLowerBounds holds a double array of variable lower bounds (default = 0....
int ** getTimeDomainStageObjList()
Get the list of objectives in each stage.
double * m_mdConstraintLowerBounds
m_mdConstraintLowerBounds holds an array of constraint lower bounds (default = -INF).
int ** m_mmiTimeDomainStageVarList
m_mmiTimeDomainStageVarList holds the list of variables in each stage.
bool addMatrix(int index, std::string name, int numberOfRows, int numberOfColumns, ENUM_MATRIX_SYMMETRY symmetry, ENUM_MATRIX_TYPE matrixType, unsigned int inumberOfChildren, MatrixNode **m_mChildren)
add a matrix.
SparseMatrix * getLinearConstraintCoefficientsInRowMajor()
Get linear constraint coefficients in row major.
std::string * m_msMatrixNames
m_msMatrixNames holds the names of the matrices
int getNumberOfMatrixConstraints()
Get the number of matrix constraints.
double calculateFunctionValue(int idx, double *x, bool new_x)
Calculate the function value for function (constraint or objective) indexed by idx.
double ** m_mmdDenseObjectiveCoefficients
m_mmdDenseObjectiveCoefficients holds an array of pointers, each pointer points to a vector of dense ...
int * getTimeDomainStageNumberOfConstraints()
Get the number of constraints contained in each time stage.
double getTimeDomainIntervalStart()
Get the start for the time domain interval.
SparseMatrix * m_linearConstraintCoefficientsInColumnMajor
m_linearConstraintCoefficientsInColumnMajor holds the standard three-array data structure for linear ...
int * m_miNonLinearVarsReverseMap
m_miNonLinearVarsReverseMap maps the nonlinear variable number back into the original variable space
int * getNonlinearExpressionTreeIndexes()
Get all the nonlinear expression tree indexes, i.e., indexes of rows (objectives or constraints) that...
std::string * getTimeDomainStageNames()
Get the names of the stages (NULL or empty string ("") if a stage has not been given a name.
char * getVariableTypes()
Get variable initial values.
std::string m_sInstanceName
----— data items for InstanceHeader ----—
char * m_mcVariableTypes
m_mcVariableTypes holds a char array of variable types (default = 'C').
bool matrixHasBlocks(int n)
int getNumberOfQuadraticRowIndexes()
Get the number of rows which have a quadratic term.
double * calculateAllObjectiveFunctionValues(double *x, double *objLambda, double *conLambda, bool new_x, int highestOrder)
Calculate all of the objective function values.
double * m_mdJacValue
m_mdJacValue holds a double array of partial derivatives for the Jacobian matrix in sparse form (row ...
SparseVector * calculateConstraintFunctionGradient(double *x, double *objLambda, double *conLambda, int idx, bool new_x, int highestOrder)
Calculate the gradient of the constraint function indexed by idx.
bool getSparseJacobianFromRowMajor()
SparseMatrix * getLinearConstraintCoefficientsInColumnMajor()
Get linear constraint coefficients in column major.
int * getQuadraticRowIndexes()
Get the indexes of rows which have a quadratic term.
int m_iMatrixObjNumber
m_iMatrixObjNumber holds the number of matrix objectives
bool processObjectives()
process objectives.
int m_iMatrixConNumber
m_iMatrixConNumber holds the number of matrix constraints
int getNumberOfSemiContinuousVariables()
getNumberOfSemiContinuousVariables
int * m_miTimeDomainStageConstraintNumber
m_miTimeDomainStageConstraintNumber holds the number of constraints in each stage.
double * calculateObjectiveFunctionGradient(double *x, double *objLambda, double *conLambda, int objIdx, bool new_x, int highestOrder)
Calculate the gradient of the objective function indexed by objIdx.
int getMatrixNumber()
Get the number of matrices.
int * getNonlinearExpressionTreeModIndexes()
Get all the nonlinear expression tree indexes, i.e., indexes of rows (objectives or constraints) that...
bool m_bDuplicateExpressionTreesMap
m_bDuplicateExpressionTreeMap is true if m_mapExpressionTrees was duplicated.
bool setTimeDomainStageConstraintsOrdered(int numberOfStages, int *numberOfConstraints, int *startIdx)
This sets the constraints associated with each time domain stage in temporal order.
bool setVariables(int number, std::string *names, double *lowerBounds, double *upperBounds, char *types)
set all the variable related elements.
bool createOSADFun(std::vector< double > vdX)
Create the a CppAD Function object: this is a function where the domain is the set of variables for t...
std::string getInstanceCreator()
Get instance fileCreator.
int m_iNumberOfSemiIntegerVariables
m_iNumberOfSemiIntegerVariables holds the number of semi-integer variables.
bool setTimeDomainStageVariablesOrdered(int numberOfStages, int *numberOfVariables, int *startIdx)
This sets the variables associated with each time domain stage in temporal order.
bool setInstanceSource(std::string source)
set the instance source.
bool m_bColumnMajor
m_bColumnMajor holds whether the linear constraint coefficients are stored in column major (if m_bCol...
std::string getInstanceLicence()
Get instance licence.
QuadraticTerms * m_quadraticTerms
m_quadraticTerms holds the data structure for all the quadratic terms in the instance.
double ** getDenseObjectiveCoefficients()
getDenseObjectiveCoefficients.
bool setTimeDomainStageVariablesUnordered(int numberOfStages, int *numberOfVariables, int **varIndex)
This sets the variables associated with each time domain stage in srbitrary order.
bool initForAlgDiff()
This should be called by nonlinear solvers using callback functions.
int * getMatrixExpressionTreeIndexes()
Get all the matrix expression tree indexes, i.e.
GeneralFileHeader * instanceHeader
the instanceHeader is implemented as a general file header object to allow sharing of classes between...
std::map< int, ScalarExpressionTree * > m_mapExpressionTreesMod
m_mapExpressionTreesMod holds a map of expression trees, with the key being the row index and value b...
std::string * m_msConstraintNames
m_msConstraintNames holds an array of constraint names.
int m_iObjectiveNumber
m_iObjectiveNumber is the number of objective functions.
bool m_bCppADMustReTape
is true if a CppAD Expresion Tree has an expression that can change depending on the value of the inp...
Nl ** getNonlinearExpressions()
Get the pointers to the roots of all expression trees.
bool setLinearConstraintCoefficients(int numberOfValues, bool isColumnMajor, double *values, int valuesBegin, int valuesEnd, int *indexes, int indexesBegin, int indexesEnd, int *starts, int startsBegin, int startsEnd)
set linear constraint coefficients
int getNumberOfElementConstructors(int n)
InstanceData * instanceData
A pointer to an InstanceData object.
int m_iHighestOrderEvaluated
m_iHighestOrderEvaluated is the highest order derivative of the current iterate
OSInstance()
The OSInstance class constructor.
std::map< int, int > m_mapAllNonlinearVariablesIndex
m_mapAllNonlinearVariablesIndexMap is a map of the variables in the Lagrangian function
std::string getMatrixExpressionTreeInInfix(int rowIdx)
Get the infix representation for a given row (or objective function) index.
int getNumberOfNonlinearExpressions()
Get number of nonlinear expressions.
SparseHessianMatrix * getLagrangianHessianSparsityPattern()
SparseVector ** getObjectiveCoefficients()
Get objective coefficients.
int m_iNumberOfIntegerVariables
m_iNumberOfIntegerVariables holds the number of integer variables.
std::map< int, int > getAllNonlinearVariablesIndexMap()
SparseHessianMatrix * calculateHessian(double *x, int idx, bool new_x)
Calculate the Hessian of a constraint or objective function.
QuadraticTerms * getQuadraticTerms()
Get all the quadratic terms in the instance.
int ** getTimeDomainStageConList()
Get the list of constraints in each stage.
std::vector< double > reverseAD(int p, std::vector< double > vdlambda)
Perform an AD reverse sweep.
SparseMatrix * m_linearConstraintCoefficientsInRowMajor
m_linearConstraintCoefficientsInRowMajor holds the standard three-array data structure for linear con...
std::vector< ExprNode * > getNonlinearExpressionTreeInPostfix(int rowIdx)
Get the postfix tokens for a given row index.
double * getObjectiveConstants()
Get objective constants.
std::string * getObjectiveNames()
Get objective names.
bool processLinearConstraintCoefficients()
process linear constraint coefficients.
int getNumberOfMatrixObjectives()
Get the number of matrix objectives.
double * getVariableLowerBounds()
Get variable lower bounds.
int m_iConstraintNumber
m_iConstraintNumber is the number of constraints.
bool m_bLagrangianSparseHessianCreated
m_bLagrangianSparseHessianCreated is true if the sparse Hessian Matrix for the Lagrangian was created
int getVariableNumber()
Get number of variables.
bool m_bGetDenseObjectives
m_bGetDenseObjectives holds whether the dense objective functions are processed.
std::map< int, MatrixExpressionTree * > getAllMatrixExpressionTreesMod()
bool m_bOSADFunIsCreated
m_bOSADFunIsCreated is true if we have created the OSInstanc OSAD Function
std::string * m_msTimeDomainStageNames
m_msTimeDomainStageNames holds the names of the time stages.
bool m_binitForAlgDiff
----— data items for automatic differentiation ----—
std::map< int, MatrixExpressionTree * > m_mapMatrixExpressionTrees
m_mapMatrixExpressionTrees holds a hash map of matrix-valued expression tree pointers.
~OSInstance()
The OSInstance class destructor.
bool setTimeDomainStageObjectivesOrdered(int numberOfStages, int *numberOfObjectives, int *startIdx)
This sets the objectives associated with each time domain stage in temporal order.
int m_iNumberOfStringVariables
m_iNumberOfStringVariables holds the number of string-valued variables.
MatrixExpressionTree * getMatrixExpressionTree(int rowIdx)
Get the matrix expression tree for a given row index.
bool setInstanceDescription(std::string description)
set the instance description.
bool setTimeDomainInterval(double start, double horizon)
This sets the start and end of the time interval.
std::string * getVariableNames()
Get variable names.
ENUM_MATRIX_TYPE * m_miMatrixType
m_miMatrixType holds the type of each matrix.
std::vector< ExprNode * > getNonlinearExpressionTreeModInPrefix(int rowIdx)
Get the prefix tokens for a given row index for the modified Expression Tree (quadratic terms added).
bool m_bProcessVariables
----— data items for Variables ----—
bool setObjectives(int number, std::string *names, std::string *maxOrMins, double *constants, double *weights, SparseVector **objectitiveCoefficients)
set all the objectives related elements.
std::string getInstanceName()
Get instance name.
ScalarExpressionTree * getNonlinearExpressionTree(int rowIdx)
Get the expression tree for a given row index.
bool setTimeDomainStageObjectivesUnordered(int numberOfStages, int *numberOfObjectives, int **varIndex)
This sets the objectives associated with each time domain stage in arbitrary order.
int * m_miMatrixNumberOfRows
m_miMatrixNumberOfRows holds the number of rows for each matrix.
int getNumberOfTransformationConstructors(int n)
std::string m_sInstanceSource
m_sInstanceSource holds the instance source.
int getNumberOfMatrixExpressions()
Get the number of matrix-valued expressions.
char * getConstraintTypes()
Get constraint types.
GeneralSparseMatrix * getMatrixCoefficientsInRowMajor(int n)
Get the (nonzero) elements of the matrix in row major form.
bool processVariables()
process variables.
bool addQTermsToExpressionTree()
This method adds quadratic terms into the array of expression trees.
bool setInstanceName(std::string name)
set the instance name.
SparseHessianMatrix * m_LagrangianSparseHessian
m_LagrangianSparseHessian is the Hessian Matrix of the Lagrangian function in sparse format
int m_iNumberOfNonlinearExpressionTreeModIndexes
m_iNumberOfNonlinearExpressionTreeModIndexes holds the number of distinct rows and objectives with no...
bool addObjective(int index, std::string name, std::string maxOrMin, double constant, double weight, SparseVector *objectiveCoefficients)
add an objective.
bool m_bProcessConstraints
----— data items for Constraints ----—
SparseHessianMatrix * calculateLagrangianHessian(double *x, double *objLambda, double *conLambda, bool new_x, int highestOrder)
Calculate the Hessian of the Lagrangian Expression Tree This method will build the CppAD expression t...
bool setConstraints(int number, std::string *names, double *lowerBounds, double *upperBounds, double *constants)
set all the constraint related elements.
std::string * getConstraintNames()
Get constraint names.
std::vector< double > m_vdLambda
m_vdYval is a vector of Lagrange multipliers
bool setObjectiveNumber(int number)
set the number of objectives.
std::vector< double > m_vdX
----— data vectors for nonlinear optimization ----—
double ** m_mmdObjGradient
m_mdObjGradient holds an array of pointers, each pointer points to gradient of one objective function...
ScalarExpressionTree * m_LagrangianExpTree
m_LagrangianExpTree is an ScalarExpressionTree object that is the expression tree for the Lagrangian ...
std::vector< ExprNode * > getMatrixExpressionTreeModInPostfix(int rowIdx)
Get the postfix tokens for a given row index for the modified Expression Tree (quadratic terms added)...
std::string getNonlinearExpressionTreeInInfix(int rowIdx)
Get the infix representation for a given row (or objective function) index.
bool setMatrixNumber(int number)
set the number of matrices
int * m_miJacIndex
m_miJacIndex holds a int array of variable indices for the Jacobian matrix in sparse form (row major)...
bool setVariableNumber(int number)
set the number of variables.
std::string * getObjectiveMaxOrMins()
Get objective maxOrMins.
std::string m_sInstanceDescription
m_sInstanceDescription holds the instance description.
bool initializeNonLinearStructures()
Initialize the data structures for the nonlinear API.
double ** calculateAllObjectiveFunctionGradients(double *x, double *objLambda, double *conLambda, bool new_x, int highestOrder)
Calculate the gradient of all objective functions.
double * getConstraintUpperBounds()
Get constraint upper bounds.
int getObjectiveNumber()
Get number of objectives.
SparseJacobianMatrix * m_sparseJacMatrix
m_sparseJacMatrix is the Jacobian matrix stored in sparse matrix format
std::map< int, ScalarExpressionTree * > getAllNonlinearExpressionTreesMod()
int m_iNumberOfNonlinearExpressionTreeIndexes
----— data items for nonlinear expressions ----—
bool getSecondOrderResults(double *x, double *objLambda, double *conLambda)
Calculate second derivatives.
int m_iJacValueSize
m_iJacValueSize is the number of nonzero partial derivates in the Jacobian.
std::vector< ExprNode * > getMatrixExpressionTreeInPrefix(int rowIdx)
Get the prefix tokens for a given row index.
bool IsEqual(OSInstance *that)
A function to check for the equality of two objects.
int getNumberOfNonlinearConstraints()
double * m_mdConstraintConstants
m_mdConstraintConstants holds an array of constraint constants (default = 0.0).
void duplicateExpressionTreesMap()
duplicate the map of expression trees.
a data structure to represent a matrix object (derived from MatrixType)
bool setMatrix(std::string name, int numberOfRows, int numberOfColumns, ENUM_MATRIX_SYMMETRY symmetry, ENUM_MATRIX_TYPE matrixType, unsigned int inumberOfChildren, MatrixNode **m_mChildren)
add values to this matrix.
virtual ENUM_MATRIX_TYPE getMatrixType()
std::vector< ExprNode * > getPrefixFromExpressionTree()
Get a vector of pointers to OSnLNodes and OSnLMNodes that correspond to the (matrix-valued) expressio...
std::vector< ExprNode * > getPostfixFromExpressionTree()
Get a vector of pointers to ExprNodes that correspond to the expression tree in postfix format.
The OSnLNode Class for nonlinear expressions.
OSnLNode * createExpressionTreeFromPostfix(std::vector< ExprNode * > nlNodeVec)
Take a vector of ExprNodes (OSnLNodes and OSnLMNodes) in postfix format and create a scalar-valued OS...
virtual std::vector< ExprNode * > getPostfixFromExpressionTree()
Get a vector of pointers to ExprNodes that correspond to the expression tree in postfix format.
virtual std::vector< ExprNode * > getPrefixFromExpressionTree()
Get a vector of pointers to OSnLNodes and OSnLMNodes that correspond to the (scalar-valued or matrix-...
The OSnLNodeNumber Class.
double value
value is the value of the number
The OSnLNodeProduct Class.
The OSnLNodeVariable Class.
int idx
idx is the index of the variable
double coef
coef is an option coefficient on the variable, the default value is 1.0
The in-memory representation of the objective function <coef> element.
bool IsEqual(ObjCoef *that)
A function to check for the equality of two objects.
double value
value is the value of the objective function coefficient corresponding to the variable with index idx
ObjCoef()
The ObjCoef class constructor.
int idx
idx is the index of the variable corresponding to the coefficient
~ObjCoef()
The ObjCoef class destructor.
The in-memory representation of the <obj> element.
ObjCoef ** coef
coef is pointer to an array of ObjCoef object pointers
double constant
constant is the constant term added to the objective function, 0 by default
double weight
weight is the weight applied to the given objective function, 1.0 by default
bool IsEqual(Objective *that)
A function to check for the equality of two objects.
int numberOfObjCoef
numberOfObjCoef is the number of variables with a nonzero objective function coefficient
~Objective()
The Objective class destructor.
Objective()
The Objective class constructor.
std::string name
the name of the objective function
std::string maxOrMin
declare the objective function to be a max or a min
The in-memory representation of the <objectives> element.
bool IsEqual(Objectives *that)
A function to check for the equality of two objects.
int numberOfObjectives
numberOfObjectives is the number of objective functions in the instance
Objective ** obj
coef is pointer to an array of ObjCoef object pointers
Objectives()
The Objectives class constructor.
~Objectives()
The Objectives class destructor.
OrthantCone()
default constructor.
virtual std::string getConeInXML()
Write an OrthantCone object in XML format.
~OrthantCone()
default destructor.
virtual std::string getConeName()
double * ub
For each dimension of the cone, give the upper and lower bounds The upper bound can be only zero or +...
The in-memory representation of a polar cone.
bool IsEqual(PolarCone *that)
A function to check for the equality of two objects.
int referenceConeIdx
Polar cones use a reference to another, previously defined cone.
PolarCone()
The PolarCone class constructor.
virtual std::string getConeName()
~PolarCone()
The PolarCone class destructor.
The in-memory representation of a polyhedral cone.
~PolyhedralCone()
The PolyhedralCone class destructor.
int numberOfRows
Every cone has (at least) two dimensions; no distinction is made between vector cones and matrix cone...
bool IsEqual(PolyhedralCone *that)
A function to check for the equality of two objects.
virtual std::string getConeInXML()
Write a PolyhedralCone object in XML format.
PolyhedralCone()
The PolyhedralCone class constructor.
int referenceMatrixIdx
Polyhedral cones use a reference to a previously defined matrix for the extreme rays.
virtual std::string getConeName()
The in-memory representation of a product cone.
virtual std::string getConeInXML()
Write a ProductCone object in XML format.
~ProductCone()
The ProductCone class destructor.
IntVector * factors
the list of "factors" contributing to the product each factor contains a reference to a previously de...
ProductCone()
The ProductCone class constructor.
virtual std::string getConeName()
int numberOfRows
Every cone has (at least) two dimensions; no distinction is made between vector cones and matrix cone...
bool IsEqual(ProductCone *that)
A function to check for the equality of two objects.
The in-memory representation of the <quadraticCoefficients> element.
QuadraticTerm ** qTerm
qTerm is a pointer to an array of QuadraticTerm object pointers
bool IsEqual(QuadraticCoefficients *that)
A function to check for the equality of two objects.
QuadraticCoefficients()
The QuadraticCoefficients class constructor.
int numberOfQuadraticTerms
numberOfQuadraticTerms is the number of quadratic terms in the <quadraticCoefficients> element.
~QuadraticCoefficients()
The QuadraticCoefficients class destructor.
The in-memory representation of a quadratic cone.
virtual std::string getConeName()
virtual std::string getConeInXML()
Write a QuadraticCone object in XML format.
~QuadraticCone()
The QuadraticCone class destructor.
int axisDirection
The index of the first component can be changed Since there are possibly many dimensions,...
bool IsEqual(QuadraticCone *that)
A function to check for the equality of two objects.
int numberOfRows
Every cone has (at least) two dimensions; no distinction is made between vector cones and matrix cone...
QuadraticCone()
The QuadraticCone class constructor.
double normScaleFactor
quadratic cones normally are of the form x0 >= x1^2 + x2^2 + ... However, the appearance can be modif...
The in-memory representation of the <qTerm> element.
double coef
coef is the coefficient of the quadratic term
int idxOne
idxOne is the index of the first variable in the quadratic term
~QuadraticTerm()
The QuadraticTerm class destructor.
QuadraticTerm()
The QuadraticTerm class constructor.
bool IsEqual(QuadraticTerm *that)
A function to check for the equality of two objects.
int idx
idx is the index of the row in which the quadratic term appears
int idxTwo
idxTwo is the index of the second variable in the quadratic term
a data structure for holding quadratic terms
int * varTwoIndexes
varTwoIndexes holds an integer array of the second variable indexes of all the quadratic terms.
int * rowIndexes
rowIndexes holds an integer array of row indexes of all the quadratic terms.
double * coefficients
coefficients holds a double array all the quadratic term coefficients.
int * varOneIndexes
varOneIndexes holds an integer array of the first variable indexes of all the quadratic terms.
The in-memory representation of a rotated quadratic cone.
bool IsEqual(RotatedQuadraticCone *that)
A function to check for the equality of two objects.
virtual std::string getConeName()
~RotatedQuadraticCone()
The RotatedQuadraticCone class destructor.
double normScaleFactor
rotated quadratic cones normally are of the form x0x1 >= x2^2 + x3^2 + ... However,...
RotatedQuadraticCone()
The RotatedQuadraticCone class constructor.
int firstAxisDirection
The indices of the first two component can be changed Since there are possibly many dimensions,...
int numberOfRows
Every cone has (at least) two dimensions; no distinction is made between vector cones and matrix cone...
virtual std::string getConeInXML()
Write a RotatedQuadraticCone object in XML format.
Used to hold part of the instance in memory.
bool IsEqual(ScalarExpressionTree *that)
A function to check for the equality of two objects.
std::map< int, int > * getVariableIndicesMap()
Retrieve a map of the indices of the variables that are in the expression tree.
OSnLNode * m_treeRoot
m_treeRoot holds the root node (of OSnLNode type) of the expression tree.
The in-memory representation of a cone of semidefinite matrices.
~SemidefiniteCone()
The SemidefiniteCone class destructor.
SemidefiniteCone()
The SemidefiniteCone class constructor.
virtual std::string getConeName()
virtual std::string getConeInXML()
Write a SemidefiniteCone object in XML format.
std::string semidefiniteness
we need to distinguish positive and negative semidefiniteness
int numberOfRows
Every cone has (at least) two dimensions; no distinction is made between vector cones and matrix cone...
bool IsEqual(SemidefiniteCone *that)
A function to check for the equality of two objects.
The in-memory representation of a SparseHessianMatrix..
int * hessRowIdx
hessRowIdx is an integer array of row indices in the range 0, ..., n - 1.
int hessDimension
hessDimension is the number of nonzeros in each array.
double * hessValues
hessValues is a double array of the Hessian values.
int * hessColIdx
hessColIdx is an integer array of column indices in the range 0, ..., n - 1.
bool bDeleteArrays
bDeleteArrays is true if we delete the arrays in garbage collection set to true by default
a sparse Jacobian matrix data structure
int * indexes
indexes holds an integer array of variable indices.
bool bDeleteArrays
bDeleteArrays is true if we delete the arrays in garbage collection set to true by default
int valueSize
valueSize is the dimension of the values array
int * starts
starts holds an integer array of start elements, each start element points to the start of partials f...
int * conVals
conVals holds an integer array of integers, conVals[i] is the number of constant terms in the gradien...
double * values
values holds a double array of nonzero partial derivatives
a sparse matrix data structure
int * indexes
indexes holds an integer array of rowIdx (or colIdx) elements in coefMatrix (AMatrix).
int valueSize
valueSize is the dimension of the indexes and values arrays
bool bDeleteArrays
bDeleteArrays is true if we delete the arrays in garbage collection set to true by default
int * starts
starts holds an integer array of start elements in coefMatrix (AMatrix), which points to the start of...
double * values
values holds a double array of value elements in coefMatrix (AMatrix), which contains nonzero element...
bool isColumnMajor
isColumnMajor holds whether the coefMatrix (AMatrix) holding linear program data is stored by column.
int startSize
startSize is the dimension of the starts array
a sparse vector data structure
double * values
values holds a double array of nonzero values.
int * indexes
indexes holds an integer array of indexes whose corresponding values are nonzero.
int number
number is the number of elements in the indexes and values arrays.
bool bDeleteArrays
bDeleteArrays is true if we delete the arrays in garbage collection set to true by default
The in-memory representation of the <timeDomain> element.
TimeDomainStages * stages
stages is a pointer to a Stages object
TimeDomain()
The TimeDomain class constructor.
TimeDomainInterval * interval
interval is a pointer to an Interval object
~TimeDomain()
The TimeDomain class destructor.
~TimeDomainInterval()
The Interval class destructor.
double start
start is the start of the planning period in the <interval> element.
double horizon
horizon is the end of the planning period in the <interval> element.
TimeDomainInterval()
The Interval class constructor.
The in-memory representation of the <con> element.
int idx
idx gives the index of this constraint
~TimeDomainStageCon()
The TimeDomainStageCon class destructor.
TimeDomainStageCon()
The TimeDomainStageCon class constructor.
The in-memory representation of the <constraints> child of the <stage> element.
int numberOfConstraints
numberOfConstraints gives the number of constraints contained in this stage
~TimeDomainStageConstraints()
The TimeDomainStageConstraints class destructor.
TimeDomainStageConstraints()
The TimeDomainStageConstraints class constructor.
TimeDomainStageCon ** con
con is a pointer to an array of TimeDomainStageCon object pointers
int startIdx
startdIdx gives the number of the first constraint contained in this stage
The in-memory representation of the <stage> element.
TimeDomainStageVariables * variables
variables is a pointer to a TimeDomainVariables object
std::string name
name corresponds to the optional attribute that holds the name of the stage; the default value is emp...
~TimeDomainStage()
The TimeDomainStage class destructor.
TimeDomainStageObjectives * objectives
objectives is a pointer to a TimeDomainObjectives object
TimeDomainStageConstraints * constraints
constraints is a pointer to a TimeDomainConstraints object
TimeDomainStage()
The TimeDomainStage class constructor.
The in-memory representation of the <obj> element.
int idx
idx gives the index of this variable
~TimeDomainStageObj()
The TimeDomainStageObj class destructor.
TimeDomainStageObj()
The TimeDomainStageObj class constructor.
The in-memory representation of the <objectives> child of the <stage> element.
TimeDomainStageObj ** obj
obj is a pointer to an array of TimeDomainStageObj object pointers
int startIdx
startdIdx gives the number of the first objective contained in this stage
TimeDomainStageObjectives()
The TimeDomainStageObjectives class constructor.
int numberOfObjectives
numberOfObjectives gives the number of objectives contained in this stage
~TimeDomainStageObjectives()
The TimeDomainStageObjectives class destructor.
The in-memory representation of the element.
TimeDomainStageVar()
The TimeDomainStageVar class constructor.
int idx
idx gives the index of this variable
~TimeDomainStageVar()
The TimeDomainStageVar class destructor.
The in-memory representation of the <variables> child of the <stage> element.
TimeDomainStageVar ** var
var is a pointer to an array of TimeDomainStageVar object pointers
TimeDomainStageVariables()
The TimeDomainStageVariables class constructor.
int numberOfVariables
numberOfVariables gives the number of variables contained in this stage
int startIdx
startdIdx gives the number of the first variable contained in this stage
~TimeDomainStageVariables()
The TimeDomainStageVariables class destructor.
The in-memory representation of the <stages> element.
TimeDomainStage ** stage
stage is pointer to an array of stage object pointers
TimeDomainStages()
The Stages class constructor.
int numberOfStages
numberOfStages is the number of stages in the <stages> element.
~TimeDomainStages()
The Stages class destructor.
The in-memory representation of the variable element.
bool IsEqual(Variable *that)
A function to check for the equality of two objects.
Variable()
The Variable class constructor.
double ub
ub corresponds to the optional attribute that holds the variable upper bound.
std::string name
name corresponds to the optional attribute that holds the variable name, the default value is empty
~Variable()
The Variable class destructor.
double lb
lb corresponds to the optional attribute that holds the variable lower bound.
char type
type corresponds to the attribute that holds the variable type: C (Continuous), B (binary),...
The in-memory representation of the variables element.
bool IsEqual(Variables *that)
A function to check for the equality of two objects.
Variables()
The Variables class constructor.
~Variables()
The Variables class destructor.
int numberOfVariables
numberOfVariables is the number of variables in the instance
Variable ** var
Here we define a pointer to an array of var pointers.
This file defines the OSInstance class along with its supporting classes.
@ ENUM_NL_EXPR_SHAPE_general
int returnVarType(char vt)
bool verifyVarType(char vt)
@ ENUM_CONE_TYPE_nonnegative
@ ENUM_CONE_TYPE_quadratic
@ ENUM_CONE_TYPE_nonpositive
@ ENUM_CONE_TYPE_rotatedQuadratic
@ ENUM_CONE_TYPE_intersection
@ ENUM_CONE_TYPE_copositiveMatrices
@ ENUM_CONE_TYPE_semidefinite
@ ENUM_CONE_TYPE_polyhedral
@ ENUM_CONE_TYPE_completelyPositiveMatrices
@ ENUM_OUTPUT_LEVEL_detailed_trace
@ ENUM_OUTPUT_LEVEL_debug
@ ENUM_OUTPUT_LEVEL_trace
ENUM_MATRIX_TYPE
An enum to track the many different types of values that a matrix can contain Note that these types a...
@ ENUM_MATRIX_TYPE_unknown
ENUM_MATRIX_TYPE mergeMatrixType(ENUM_MATRIX_TYPE type1, ENUM_MATRIX_TYPE type2)
A function to merge two matrix types so we can infer the type of a matrix recursively.
@ ENUM_MATRIX_CONSTRUCTOR_TYPE_transformation
@ ENUM_MATRIX_CONSTRUCTOR_TYPE_blocks
@ ENUM_MATRIX_CONSTRUCTOR_TYPE_baseMatrix
@ ENUM_OUTPUT_AREA_OSInstance
@ ENUM_VARTYPE_continuous
@ ENUM_VARTYPE_semicontinuous
@ ENUM_VARTYPE_semiinteger