dev_disciplined_convex_programming2.cpp
Go to the documentation of this file.
00001 /*
00002  *    This file is part of ACADO Toolkit.
00003  *
00004  *    ACADO Toolkit -- A Toolkit for Automatic Control and Dynamic Optimization.
00005  *    Copyright (C) 2008-2014 by Boris Houska, Hans Joachim Ferreau,
00006  *    Milan Vukov, Rien Quirynen, KU Leuven.
00007  *    Developed within the Optimization in Engineering Center (OPTEC)
00008  *    under supervision of Moritz Diehl. All rights reserved.
00009  *
00010  *    ACADO Toolkit is free software; you can redistribute it and/or
00011  *    modify it under the terms of the GNU Lesser General Public
00012  *    License as published by the Free Software Foundation; either
00013  *    version 3 of the License, or (at your option) any later version.
00014  *
00015  *    ACADO Toolkit is distributed in the hope that it will be useful,
00016  *    but WITHOUT ANY WARRANTY; without even the implied warranty of
00017  *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00018  *    Lesser General Public License for more details.
00019  *
00020  *    You should have received a copy of the GNU Lesser General Public
00021  *    License along with ACADO Toolkit; if not, write to the Free Software
00022  *    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
00023  *
00024  */
00025 
00026 
00027 
00034 #include <time.h>
00035 #include <acado_toolkit.hpp>
00036 
00037 /* >>> start tutorial code >>> */
00038 int main( ){
00039 
00040     USING_NAMESPACE_ACADO
00041 
00042     int i;
00043 
00044     // DEFINE VALRIABLES:
00045     // ---------------------------
00046     DifferentialState         x;
00047     IntermediateState         z;
00048     Function               f[7];
00049 
00050     // DEFINE TEST FUNCTIONS:
00051     // -----------------------
00052     z     = 0.5*x + 1.0;
00053 
00054     f[0] << sqrt(z);
00055     f[1] << z*sqrt(z);
00056     f[2] << pow(z,3.0/2.0);
00057     f[3] << pow(z,2.0/3.0);
00058     f[4] << pow(2.0,z);
00059     f[5] << exp(z+exp(z));
00060     f[6] << pow(0.5,entropy(x)-z);
00061 
00062     for( i = 0; i < 7; i++ ){
00063         if( f[i].isConvex() == BT_TRUE )
00064             printf("f[%d] is convex. \n", i );
00065         else{
00066             if( f[i].isConcave() == BT_TRUE )
00067                   printf("f[%d] is concave. \n", i );
00068             else
00069                   printf("f[%d] is neither convex nor concave. \n", i );
00070         }
00071     }
00072     return 0;
00073 }
00074 /* <<< end tutorial code <<< */


acado
Author(s): Milan Vukov, Rien Quirynen
autogenerated on Thu Aug 27 2015 11:58:05