Changes between Version 17 and Version 18 of OfficialTolArchiveNetworkNonLinGloOpt

Timestamp:

Jan 4, 2011, 2:25:38 PM (15 years ago)

Author:

Víctor de Buen Remiro

Comment:

--

OfficialTolArchiveNetworkNonLinGloOpt

@@ -241 +241 @@
 
 
-[[Image(source:/tolp/OfficialTolArchiveNetwork/NonLinGloOpt/doc/opt_methods.png)]]
-
 == Tutorial == 
 
@@ -335 +333 @@
 }}}
  
-=== Definición del problema y sus características ===
+=== Creación y lanzamiento de la optimización ===
 
 {{{
@@ -342 +340 @@
 #Require NonLinGloOpt;
 
-//Defining the problem
-NonLinGloOpt::@Problem problem = [[
-//Optimization method. If not specified the system will choose one
-//by calling method select_automatic_algorithm
-//In this case we want to use MMA (Method of Moving Asymptotes)
-// http://ab-initio.mit.edu/wiki/index.php/NLopt_Algorithms#MMA_.28Method_of_Moving_Asymptotes.29 
-  Real id_algorithm = NonLinGloOpt::Algorithm::LD_MMA;  
-  //We want to minimize the target function
-  Real sign = -1;
-  //We want just a local minimum
-  Real neededGlobal = False;
-  //The problem is almost twice differentiable
-  Real id_analyticalClass = 
-    NonLinGloOpt::AnalyticalClass::TWICE_DIFFERENTIABLE;
-  //The gradient of all functions is known 
-  Real id_useGradient = True;
-  //Target given as simple Code
-  Anything target = my_function;
-  //Lower bounds 
-  Matrix lower_bounds = Col(-1/0,  0); // -x2 <= 0
-  //No upper bounds. You can skip next line
-  Matrix upper_bounds = Col( 1/0, 1/0); 
-  //There are two non linear constraining inequations 
-  Set inequations = [[
-   [[ineq1, ineq1::constraint]], //Inequation given by class method
-   [[ineq2, ineq2::constraint]]  //Inequation given by class method
-  ]];
-  //Initial values
-  Matrix x0 = Col(1.234, 5.678); 
-  //Stopping criteria of relative tolerance for both x and y
-  Real relativeTolerance = 1E-4; //
-  //Stopping criteria of maximum running time
-  Real maxTime = 60; 
-  //Functions will be traced every "verboseEach" evaluations
-  Real verboseEach = 1
+NonLinGloOpt::@PipeLine pipe_line = [[
+  //Defining the problem
+  Set problems = [[ NonLinGloOpt::@Problem problem = [[
+    //We want to minimize the target function
+    Real sign = -1;
+    //We want just a local minimum
+    Real neededGlobal = False;
+    //The problem is almost twice differentiable
+    Real id_analyticalClass = 
+      NonLinGloOpt::AnalyticalClass::TWICE_DIFFERENTIABLE;
+    //The gradient of all functions is known 
+    Real id_useGradient = True;
+    //Problem dimension
+    Real n = 2;
+    //Target given as simple Code
+    Anything target = my_function;
+    //Lower bounds 
+    Matrix lower_bounds = Col(-10,  0); //x1>=-10, x2 >= 0
+    //Upper bounds 
+    Matrix upper_bounds = Col( 10, 10); //x1<= 10, x2 <=10
+    //There are two non linear constraining inequations 
+    Set inequations = [[
+     [[ineq1, ineq1::constraint]], //Inequation given by class method
+     [[ineq2, ineq2::constraint]]  //Inequation given by class method
+    ]]
+  ]] ]];
+  //Initial point
+  Matrix x0 = Col(1.234, 5.678),
+  Real verboseEach = 100
 ]];
 
-}}}
-
-=== Creación y lanzamiento de la optimización ===
-
-{{{
-#!cpp
-
-//Creating the optimizer instance
-NonLinGloOpt::@Opt opt = problem::create_optimizer(?);
-
-//Running the optimization
-Real opt::optimize_problem(problem);
+Real pipe_line::optimize(?);
 
 }}}