1 |
C. Audet and J. E. Dennis, A patter search filter method for nonlinear programming without dereivatives, SIAM J. Optim. (2004), no. 1, 980-1010.
|
2 |
M. J. D. Powell, A fast algorithm for nonlinear constrained optimization calculations, in Waston, G. A. (Ed.). Numerical Analysis, Springer-Verlag, Berlin. pp.144-157, 1978.
|
3 |
M. J. D. Powell, Variable metric methods for constrained optimization, in Bachen et al.(Eds.). Mathematcal programming-The state of art, Springer-Verlag, Berline. 1982.
|
4 |
M. J. D. Powell, The convergence of variable metric methods for nonlinear constrained optimiation calculations, in: O. L. Mangasarian, R. R. Meyer, S. M. Robinson(Eds.) Nonlinear Programming 3, Academic Press, New York, pp.27-63, 1978.
|
5 |
J. Stoer, Principles of sequential quadratic programming methods for solving nonlinear programs, in: K. Schittkawsk;(Ed.) NATO ASI Series, vol. F15, Computational Mathematical Programming, Springer, Berlin.
|
6 |
M. Ulbrich and S. Ulbrich, Nonmonotone trust region method for nonlinear equality constrained optimization without a penalty function, Math. Program., Ser B (2003). 103-113.
|
7 |
M. Ulbrich, S. Ulbrich and L. N. Vicente, A global convergent primal-dual interior filter method for nonconvex nonlinear programming, Math Program. (2004) no. 100, 379-410.
DOI
|
8 |
A. Watcher and L. T. Biogle, Line search filter methods for nonlinear programming:motivation and global convergence, SAIM J. Optim. (2005) no. 16, 1-31.
DOI
ScienceOn
|
9 |
A. Wathcer and L. T. Bigole, Line search filter methods for nonlinear programming: local convergence, SIAM J. Optim. (2005), no. 16, 32-48.
DOI
ScienceOn
|
10 |
J. F. Bonnons, E. R. Painer, A. L. Titts and J. L. Zhou, Avoiding the Maratos effect by means of nonmontone linesearch, Inequality constrained problems-feasible iterates, SIAM J. Numer. Anal. (1992), no. 29, 1187-1202.
DOI
ScienceOn
|
11 |
R. Fletcher and S. Leyffer, A boundle filter method for nonsmooth nonlinear optimization, Technical Report NA/195, Department of Mathematics, University of Dundee, Scotland, December, 1999.
|
12 |
P. T. Boggs, J. W. Tolle and P.Wang, On the local convergence of quasi-newton methods for constrained optimization, SIAM J. Contr. Optim. (1982), no. 20, 161-171.
DOI
ScienceOn
|
13 |
R. Fletcher and S. Leyffer, Nonlinear programming without a penalty function, Math. Program. (2002), no. 91, 239-269.
DOI
|
14 |
R. Fletcher, S. Leyffer and P. L. Toint, On the global convergence of a filter-SQP algorithm, SIAM J. Optim. (2002), no. 13, 44-59.
DOI
ScienceOn
|
15 |
R. Fletcher, N. I. M. Gould, S. Leyffer, P. L. Toint and A.Wachter, Global convergence of a trust region SQP-filter algorithm for general nonlinear programming, SIAM J. Optim. (2002) no. 13, 635-660.
DOI
ScienceOn
|
16 |
S. P. Han, Superlinearly convergence variable metric algorithm for general nonlinear programming problems, Math. Program. (1976) no. 11, 263-282.
DOI
|
17 |
S. P. Han, A globally convergent method for nonlinear programming, J. Optim. Theory Appl. (1977) no. 22, 297-309.
DOI
|
18 |
W. Hock and K. Schittkowski, Test examples for nonlinear programming codes, Lecture notes in econom. and math. systems, 187, Springer-Verlag, Berlin, 1981.
|
19 |
X. W. Liu, Global convergence on an active set SQP for inequality constrained optimization, J. Comput. Appl. Math. (2005) no. 180, 201-211.
DOI
ScienceOn
|
20 |
P. Y. Nie and C. F. Ma, A trust region filter method for general nonlinear programming, Appl. Math. Comput. (2006) no. 172, 1000-1017.
DOI
ScienceOn
|