boxparid.pro~orig

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

donlp2, v3, 05/29/98, copyright P. Spellucci
Thu Feb 24 16:53:20 2000
boxparid

     n=        12    nh=         7    ng=        16

  epsx= 1.000e-05 sigsm= 1.490e-08

startvalue
  2.5200000e+00   2.0000000e+00   3.7500000e+01   9.2500000e+00   6.8000000e+00 
  3.2745827e+04   9.6991969e+04   1.3036843e+05   2.1430114e+04   4.0167717e+03 
  1.3041991e+04   7.6195782e+03 

  eps=  2.22e-16  tol= 1.98e-323 del0=  3.00e-02 delm=  1.00e-07 tau0=  1.00e+00
  tau=  1.00e-01   sd=  1.00e-01   sw=  3.67e-11  rho=  1.00e-06 rho1=  1.00e-10
 scfm=  1.00e+04  c1d=  1.00e-02 epdi=  0.00e+00
  nre=        12 anal=         1

 termination reason:
 KT-conditions satisfied, no further correction computed
 evaluations of f                          796
 evaluations of grad f                     265
 evaluations of constraints               8767
 evaluations of grads of constraints      1855
 final scaling of objective           5.239968e-02
 norm of grad(f)                      1.058097e+06
 lagrangian violation                 1.127397e-09
 feasibility violation                4.643880e-09
 dual feasibility violation           0.000000e+00
 optimizer runtime sec's              7.900000e-01


 optimal value of f =  -5.30468013179352e+06

 optimal solution  x =
  4.53743097465548e+00  2.40000000000000e+00  6.00000000000000e+01
  9.30000000000000e+00  7.00000000000000e+00  7.55699560294418e+04
  1.98157094302557e+05  2.77200000000000e+05  2.62562431399999e+04
  4.20608070799995e+03  1.32093254640000e+04  6.59459013440011e+03

  multipliers are relativ to scf=1
  nr.    constraint      normgrad (or 1)   multiplier
    1  -1.2660166e-09    7.7931103e+04    4.1366527e+00
    2  -1.5279511e-10    1.6591636e+04   -1.4004031e+02
    3  -4.7293724e-11    2.9861440e+03    4.3349040e+01
    4   3.0922820e-11    2.9016703e+03   -3.9173787e+00
    5   1.2005330e-10    6.3758716e+03   -6.8061465e+01
    6   0.0000000e+00    1.1241714e+04    1.9136653e+01
    7  -3.0267984e-09    4.3671650e+04    1.9136653e+01
    8   4.5374310e+00    1.0000000e+00    0.0000000e+00
    9   1.2000000e+00    1.0000000e+00    0.0000000e+00
   10   4.0000000e+01    1.0000000e+00    0.0000000e+00
   11   3.0000000e-01    1.0000000e+00    0.0000000e+00
   12   5.0000000e-01    1.0000000e+00    0.0000000e+00
   13   7.5569956e+04    1.0000000e+00    0.0000000e+00
   14   1.9815709e+05    1.0000000e+00    0.0000000e+00
   15   2.7720000e+05    1.0000000e+00    0.0000000e+00
   16   4.6256903e-01    1.0000000e+00    0.0000000e+00
   17   0.0000000e+00    1.0000000e+00    4.1197922e+04
   18   0.0000000e+00    1.0000000e+00    1.7114856e+03
   19   0.0000000e+00    1.0000000e+00    7.1681226e+05
   20   0.0000000e+00    1.0000000e+00    6.1923881e+05
   21   2.1843004e+05    1.0000000e+00    0.0000000e+00
   22   9.5842906e+04    1.0000000e+00    0.0000000e+00
   23   0.0000000e+00    1.0000000e+00    1.9136653e+01

 evaluations of restrictions and their gradients
 (  1300,   265) (  1247,   265) (  1246,   265) (  1245,   265) (  1245,   265)
 (  1245,   265) (  1239,   265) (     0,     0) (     0,     0) (     0,     0)
 (     0,     0) (     0,     0) (     0,     0) (     0,     0) (     0,     0)
 (     0,     0) (     0,     0) (     0,     0) (     0,     0) (     0,     0)
 (     0,     0) (     0,     0) (     0,     0)
last estimate of condition of active gradients  1.021e+05
last estimate of condition of approx. hessian   2.371e+00
iterative steps total             264
# of restarts                     210
# of full regular updates           3
# of updates                       44
# of full regularized SQP-steps     1