参考文献/References:
[1] 倪勤. 最优化方法与程序设计 [M]. 北京: 科学出版社, 2009.
[2] Lawrence C T, Tits A L. A computationally efficient feasible sequential quadratic programming algorithm [J]. SIAM Journal on Optimization, 2001, 11(4): 1092-1118.
[3] Yuan Yaxiang. A review of trust region algorithms for optimization [C]// Ball J M, Hunt J C R. ICM99: Proceedings of the 4th International Congress on Industial and applied mathematics. Edinburgh: Oxford University Press, 2000: 271-282.
[4] Powell M J D. Convergence properties of a class of minimization algorithms [C]//Mangassarian O L, Meyer R R, Robinson S M. Nonlinear Programming. New York: Academic Press, 1975: 1-27.
[5] 夏红卫, 陈荣军. 简单界约束非线性方程组的滤子信赖域法 [J]. 江西师范大学学报: 自然科学版, 2009, 33(6): 661-664.
[6] 夏红卫, 陈荣军. 一类等式约束非线性优化问题的信赖域新算法 [J]. 数学的实践和认识, 2010, 40(20): 131-137.
[7] Chen Lifeng, Goldfarb D. Interior-point l2-penalty methods for nonlinear programming with strong global convergence properties [J]. Math Programming, 2006, 108(1): 1-36.
[8] Conn A R, Gould N I M, Orban D, et al. A primal-dual trust region algorithm for non-convex nonlinear programming [J]. Math Programming, 2000, 87(2): 215-249.
[9] Fletcher R, Leyffer S. Nonlinear programming without a penalty function [J]. Math Programming, 2002, 91(2): 239-269.
[10] Conn A R, Gould N I M, Toint P L. Trust-region methods [M]. Philadephia: SIAM, 2000.
[11] Conn A R, Gould N I M, Toint P L. Lancelot: a fortran package for large-scale nonlinear optimization [M]. New York: Springer, 1992.