hs45.c

sqp程序包。用sqp算法实现非线性约束的优化求解

/* ****************************************************************************
*/
/*                                 user functions
*/
/* ****************************************************************************
*/
#include "o8para.h"

main() {
    void donlp2(void);

    donlp2();

    exit(0);
}
/*  hs45                */
/*  solution is (1, 2, 3, 4, 5)*/

/* **************************************************************************** */
/*                              donlp2 standard setup                           */
/* **************************************************************************** */
void setup0(void) {
    #define  X extern
    #include "o8comm.h"
    #undef   X

    static INTEGER i,j,nuser = 5;
    static DOUBLE  xst0[] = {0., /* not used : index 0 */
                             2.e0, 2.e0, 2.e0, 2.e0, 2.0e0};

/* name is ident of the example/user and can be set at users will           */
/* the first static char [] must be alphabetic.  40 static char [s] maximum */

    strcpy(name,"hs45");

    /* x is initial guess and also holds the current solution */
    /* problem dimension n = dim(x), nh = dim(h), ng = dim(g) */
    
    n      = nuser;
    nh     = 0;
    ng     = 10;
    analyt = TRUE;
    epsdif = 1.e-16;
    del0   = 1.e0;
    tau0   = 1.e4;

    for (i = 1 ; i <= n ; i++) {
        x[i] = xst0[i];
    }
    /* gunit-array, see donlpdoc.ps */

    gunit[1][0] = -1;
    gunit[2][0] = 0;
    gunit[3][0] = 0;

    for (j = 1 ; j <= 10 ; j++)
      gunit[1][j] = 1;
	
    for (j = 1 ; j <= 5 ; j++)
      {
	gunit[2][j] = j;
	gunit[3][j] = 1;
      }
    for (j = 6 ; j <= 10 ; j++)
      {
	gunit[2][j] = j-5;
	gunit[3][j] = -1;
      }
    return;
}

/* **************************************************************************** */
/*                                 special setup                                */
/* **************************************************************************** */
void setup(void) {
    #define  X extern
    #include "o8comm.h"
    #undef   X
    
    return;
}

/* **************************************************************************** */
/*  the user may add additional computations using the computed solution here   */
/* **************************************************************************** */
void solchk(void) {
    #define  X extern
    #include "o8comm.h"
    #undef   X
    #include "o8cons.h"

    return;
}

/* **************************************************************************** */
/*                               objective function                             */
/* **************************************************************************** */
void ef(DOUBLE x[],DOUBLE *fx) {
    #define  X extern
    #include "o8fuco.h"
    #undef   X

    icf = icf+1;
    *fx = 2.0 - (1.0/120.0) *( x[1]*x[2]*x[3]*x[4]*x[5]);
    
    return;
}

/* **************************************************************************** */
/*                          gradient of objective function                      */
/* **************************************************************************** */
void egradf(DOUBLE x[],DOUBLE gradf[]) {
    #define  X extern
    #include "o8fuco.h"
    #undef   X


    icgf = icgf+1;
    
    gradf[1] = (- 1.0/120.0) * x[2]*x[3]*x[4]*x[5];
    gradf[2] = (- 1.0/120.0) * x[1]*x[3]*x[4]*x[5];
    gradf[3] = (- 1.0/120.0) * x[1]*x[2]*x[4]*x[5];
    gradf[4] = (- 1.0/120.0) * x[1]*x[2]*x[3]*x[5];
    gradf[5] = (- 1.0/120.0) * x[1]*x[2]*x[3]*x[4];
            
    return;
}

/* **************************************************************************** */
/*                compute the i-th equality constaint, value is hxi             */
/* **************************************************************************** */
void eh(INTEGER i,DOUBLE x[],DOUBLE *hxi) {
    #define  X extern
    #include "o8fuco.h"
    #undef   X
    return;

}

/* **************************************************************************** */
/*              compute the gradient of the i-th equality constraint            */
/* **************************************************************************** */
void egradh(INTEGER i,DOUBLE x[],DOUBLE gradhi[]) {
    #define  X extern
    #include "o8fuco.h"
    #undef   X
    return;

}

/* **************************************************************************** */
/*              compute the i-th inequality constaint, bounds included          */
/* **************************************************************************** */
void eg(INTEGER i,DOUBLE x[],DOUBLE *gxi) {
    #define  X extern
    #include "o8fuco.h"
    #undef   X
    
    if ( gunit[1][i+nh] == -1 ) cres[i+nh] = cres[i+nh]+1;

    switch (i) {
    case 1:
      *gxi = x[1];
      return;
    case 2:
      *gxi = x[2];
      return;
    case 3:
      *gxi = x[3];
      return;
    case 4:
      *gxi = x[4];
      return;
    case 5:
      *gxi = x[5];
      return;
    case 6:
      *gxi = - x[1] + 1.0;
      return;
    case 7:
      *gxi = - x[2] + 2.0;
      return;
    case 8:
      *gxi = - x[3] + 3.0;
      return;
    case 9:
      *gxi = - x[4] + 4.0;
      return;
    case 10:
      *gxi = - x[5] + 5.0;
      return;
    }    


}

/* **************************************************************************** */
/*              compute the gradient of the i-th inequality constraint          */
/*          not necessary for bounds, but constant gradients must be set        */
/*                      here e.g. using dcopy from a data-field                 */
/* **************************************************************************** */
void egradg(INTEGER i,DOUBLE x[],DOUBLE gradgi[]) {
    #define  X extern
    #include "o8fuco.h"
    #undef   X
    return;
/*     nur bounds */

}












void eval_extern(INTEGER mode) {
    #define  X extern
    #include "o8comm.h"
    #include "o8fint.h"
    #undef   X
    #include "o8cons.h"

    return;
}