Changes between Version 13 and Version 14 of OfficialTolArchiveNetworkNonLinGloOpt

Timestamp:

Dec 2, 2010, 9:34:34 AM (14 years ago)

Author:

Víctor de Buen Remiro

Comment:

--

OfficialTolArchiveNetworkNonLinGloOpt

@@ -113 +113 @@
 {{{
 #!cpp
-//If you sign ==- 1 minimized, and if sign == 1 maximizes
+//Set sign ==- 1 for minimization, sign == 1 for maximization
   Real sign;         
   
@@ -131 +131 @@
   Real id_analyticalClass;
 
-//Indicates if the gradient known or unknown in an analytical or 
-//numerical way. Must be one element of 
+//Indicates if the gradient is known analytically or numerically. 
+//Must be an element of 
 //Set NonLinGloOpt::GradientKnowneledge =
 //[[
@@ -141 +141 @@
   Real id_useGradient;  
   
-//Target function could be a simple Code or a class method of an
-//instance owner.
+//Target function could be a simple Code or a class method of a
+//particular instance.
 // - Real target(Matrix x, Matrix gradient)
 // - Set target = [[NameBlock owner, Code method]]
@@ -149 +149 @@
   Anything target;
 
-//Initial values of variables in a column matrix nx1
+//Initial values of variables in an nx1 column matrix
   Matrix x0;        
 
@@ -163 +163 @@
 //Optimization method. 
 //It must be an element of NonLinGloOpt::Algorithm
-//If is not specified the system will choose one by calling method 
+//If it is not specified the system will choose one by calling method 
 //select_automatic_algorithm
   Real id_algorithm = ?;
 
-//Lower bounds of the variables 
-//It must be a column matrix nx1 with the minimum values of each 
-//variable or -1/0 when there is unbounded
-//If there are no lower bound for any then it's the empty matrix
+//Lower bounds for the variables 
+//These must be specified by an nx1 column matrix with the minimum value for each 
+//variable, or -1/0 if the variable is not bounded below
+//If there are no lower bounds at all then it's the empty matrix
   Matrix lower_bounds = Rand(0,0,0,0); 
 
-//Variable upper bounds
-//It must be a column matrix nx1 with the minimum values of each 
-//variable or -1/0 when there is unbounded
-//If there are no upper bound for any then it's the empty matrix
+//Upper bounds for the variables 
+//These must be specified by an nx1 column matrix with the maximum value for each 
+//variable, or -1/0 if the variable is not bounded above
+//If there are no upper bounds at all then it's the empty matrix
   Matrix upper_bounds = Rand(0,0,0,0);
 
 //Set of inequality constraints g(x)<=0
-//Conjunto de elementos Code o [[NameBlock owner, Code target]] para métodos
-//Constraining function could be a simple Code or a class method of an
-//instance owner.
+//Set of Code elements or [[NameBlock owner, Code target]] for methods
+//Constraining function could be a simple Code or a class method of a
+//particular instance.
 // - Real g (Matrix x, Matrix gradient)
 // - Set g = [[NameBlock owner, Code method]]
@@ -190 +190 @@
 
 //Set of equality constraints h(x)<=0
-//Conjunto de elementos Code o [[NameBlock owner, Code target]] para métodos
-//Constraining function could be a simple Code or a class method of an
-//instance owner.
+//Set of Code elements or [[NameBlock owner, Code target]] for methods
+//Constraining function could be a simple Code or a class method of a
+//particular instance.
 // - Real h (Matrix x, Matrix gradient)
 // - Set h = [[NameBlock owner, Code method]]
@@ -200 +200 @@
 
 //Tolerance for the evaluation of inequality constraints to avoid  
-//ronding errors
+//rounding errors
   Real inequationTolerance = 1E-8;
 
 //Tolerance for the evaluation of the equality constraints to avoid  
-//ronding errors
+//rounding errors
   Real equationTolerance = 1E-8;
 
@@ -210 +210 @@
   Real relativeTolerance = 1E-6; 
 
-//Maximum run time of the stopping criteria
+//Maximum run time for the stopping criteria
   Real maxTime = ?;
 
-//If verboseEach>0, evaluation of target funciton will be traced 
-//each the specified number of evaluations.
+//If verboseEach>0, the evaluation of the target function will be traced 
+//every "verboseEach" evaluations.
   Real verboseEach = 100;
 
@@ -308 +308 @@
 #!cpp
 ////////////////////////////////////////////////////////////////////////////////
-//When a set of constraining functions are part of a parametric family
-//of funcitons we can define a class to make an easier definition
+//When a set of constraining functions is part of a parametric family
+//of functions we can define a class to facilitate the definition
 Class @my_inequation 
 ////////////////////////////////////////////////////////////////////////////////
@@ -341 +341 @@
 {{{
 #!cpp
-//Don't forget require the package if it has still no been loaded
+//Don't forget to load the package if it has not yet been loaded
 #Require NonLinGloOpt;
 
@@ -377 +377 @@
   //Stopping criteria of maximum running time
   Real maxTime = 60; 
-  //Funcitons will be traced each this number of evaluations
+  //Functions will be traced every "verboseEach" evaluations
   Real verboseEach = 1
 ]];