nmfcq11x.pro~orig

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

donlp2, v3, 05/29/98, copyright P. Spellucci
Thu Feb 24 16:54:45 2000
nmfcq11

     n=         2    nh=         1    ng=         2

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

startvalue
 -4.0000000e-01  -4.0000000e-01 

  eps=  2.22e-16  tol= 1.98e-323 del0=  1.00e+00 delm=  1.00e-06 tau0=  1.00e+04
  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=  1.00e-16
  nre=         4 anal=         1

 termination reason:
 KT-conditions satisfied, no further correction computed
 evaluations of f                           12
 evaluations of grad f                       6
 evaluations of constraints                 38
 evaluations of grads of constraints        10
 final scaling of objective           1.000000e+00
 norm of grad(f)                      1.414214e+00
 lagrangian violation                 1.093443e-15
 feasibility violation                0.000000e+00
 dual feasibility violation           0.000000e+00
 optimizer runtime sec's              4.000000e-02


 optimal value of f =  -1.41421356237309e+00

 optimal solution  x =
  7.07106781186548e-01  7.07106781186547e-01

  multipliers are relativ to scf=1
  nr.    constraint      normgrad (or 1)   multiplier
    1   0.0000000e+00    2.0000000e+00   -7.0710678e-01
    2   7.0710678e-01    1.0000000e+00    0.0000000e+00
    3   7.0710678e-01    1.0000000e+00    0.0000000e+00

 evaluations of restrictions and their gradients
 (    14,     6) (    12,     2) (    12,     2)
last estimate of condition of active gradients  1.000e+00
last estimate of condition of approx. hessian   1.028e+00
iterative steps total               5
# of restarts                       0
# of full regular updates           4
# of updates                        5
# of full regularized SQP-steps     1