Bound-constrained Quasi-Newton method with line-search

   #include <fstream>

   #include "OptBCQNewton.h"
   #include "NLF.h"
   #include "tstfcn.h"
   #include "Constraint.h"
   #include "BoundConstraint.h"
   #include "CompoundConstraint.h"
   #include "OptppArray.h"

   using NEWMAT::ColumnVector;
   using namespace OPTPP;

   void update_model(int, int, ColumnVector) {}

   int main ()
      int n = 2;
      ColumnVector lower(n), upper(n);
      static char *status_file = {"tstbcqnewton.out"};

      lower    = -2.0; upper    =  2.0;
      Constraint bc = new BoundConstraint(n, lower, upper);
      CompoundConstraint* cc = new CompoundConstraint(bc);

      //  Create a Nonlinear problem object
      NLF1 nlp(n,rosen, init_rosen, cc);

      //  Build a Newton object and optimize 
      OptBCQNewton objfcn(&nlp, update_model);

      objfcn.setOutputFile(status_file, 0);
      objfcn.printStatus("Solution from newton");

Next Section: Finite-difference nonlinear interior-point method | Back to Bound-constrained minimization

Last revised September 14, 2006 .

Bug Reports    OPT++ Developers    Copyright Information    GNU Lesser General Public License
Documentation, generated by , last revised August 30, 2006.