［1］NOCEDAL J,YUAN Y.Combining trust region and line search techniques［C］.Kluwer Academic,Dordrecht:Yuan,Y.(cd.) Advanced in Nonlinear Programming,1996:153-175.

［2］NOCEDAL J,WRIGHT S J.Numerical optimization［M］.New York:Springer,2006.

［3］CHAMBERLAIN R M,POWELL M J D,LEMARECHAL C,et al.The watchdog technique for forcing convergence in algorithm for constrained optimization［J］.Math.Program.Stud,1982(16):1-17.

［4］GRIPPO L,LAMPARIELLO F,LUCIDI F,et al.A nonmonotone line search technique for Newtons method［J］.SIAM J.Numer.Anal,1986(23):707-716.

［5］DENG N Y,XIAO Y,ZHOU F J.Nonmontonic trust region algorithm.J.Optim［J］.Theory Appllication,1993,76(3):259-285.

［6］MASOUD A,KEYVAN A.An efficient nonmonotone trust-region method for unconstrained optimization［J］.Numer.Algor,2012,59(2):523-540.

［7］DAVIDON W C.Conic approximation and collinear scaling for optimizers［J］.SIAM J.Number.Anal,1980(17):268-281.

［8］NI Q.Optimality conditions for trust-region subproblems involving a conic model［J］.SIAM J.Optim,2005,15(3):826-837.

［9］NOCEDAL J,WRIGHT S J.Numerical optimization［M］.New York:Springer,2006.

［10］陆晓平,倪勤,刘浩.解新锥模型信赖域子问题的折线法［J］.应用数学学报,2007,30(5):854-871.