A sequential quadratic programming algorithm with non-monotone line search

Pacific Journal of Optimization

Volumn 4, Issue 2, 2008, Pages 335-351

  Dai, Yu Hong ^a   Schittkowski, Klaus ^b  

^a CHINESE ACADEMY OF SCIENCES   (China)

^b UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

Convergence; Merit function; Non monotone line search; Nonlinear programming; Numerical results; Sequential quadratic programming; SQP

Indexed keywords

EID: 69249212051     PISSN: 13489151     EISSN: 13498169     Source Type: Journal    
DOI: None     Document Type: Article

References (34)

1. L. Armijo, Minimization of functions having Lipschitz continuous first partial derivatives,Pacific J. Math. l (1966) 1-3.
2. J.F. Bonnans, E. Panier, A. Tits and J.L. Zhou, Avoiding the Maratos effect by meansof a nonmonotone line search, II: Inequality constrained problems - feasible iterates,SIAM J. Numer. Anal. 29 (1992) 1187-1202.
3. I. Bongartz, A.R. Conn, N. Gould and P.h. Toint, CUTE: Constrained and unconstrainedtesting environment, Trans. Math. Soft. 21 (1995) 123-160.
4. A.R. Conn, I.M. Gould and P.L. Toint, Trust-Region Methods, SIAM, Philadelphia,2000.
5. Y.H. Dai, On the nonmonotone line search, J. Optim. Theory Appl. 112 (2002) 315-330.
6. N.Y. Deng, Y. Xiao and F.J. Zhou, Nonmonotonic trust-region algorithm, J. Optim.Theory Appl. 26 (1993) 259-285.
7. T.F. Edgar and D.M. Himmelblau, Optimization of Chemical Processes, Mc Graw Hill,New York, 1988.
8. O. Exler and K. Schittkowski, MISQP: A Fortran implementation of a trust region SQPalgorithm for mixed-integer nonlinear programming - user's guide, version 2.1, Report,Department of Computer Science, University of Bayreuth, 2006.
9. R. Fletcher, Second order correction for nondifferentiable optimization, in Numericalanalysis, G.A. Watson (ed.), Springer Verlag, Berlin, 1982, pp. 85-114.
10. D. Goldfarb and A. Idnani, A numerically stable method for solving strictly convexquadratic programs, Math. Program. 27 (1983) 1-33.
11. L. Grippo, F. Lampariello and S. Lucidi, A nonmonotone line search technique for Newtons's method, SIAM J. Numer. Anal. 23 (1986) 707-716.
12. L. Grippo, F. Lampariello and S. Lucidi, A truncated Newton method with nonmonotoneline search for unconstrained optimization, J. Optim. Theory Appl. 60 (1989)401-419.
13. L. Grippo, F. Lampariello and S. Lucidi, A class of nonmonotone stabilization methodsin unconstrained optimization, Numerische Mathematik 59 (1991) 779-805.
14. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, Vol. 187, Springer-Verlag, Berlin1981.
15. M. Hintermüller, Solving nonlienar programming problems with noisy function valuesand noisy gradients, J. Optim. Theory Appl. 114 (2002) 133-169.
16. X. Ke and J. Han, A nonmonotone trust region algorithm for equality constrainedoptimization, Science in China 38A (1995) 683-695.
17. X. Ke, G. Liu and D. Xu, A nonmonotone trust-region algorithm for unconstrainedoptimization, Chinese Science Bulletin 41 (1996) 197-201.
18. J.M. Ortega and W.C. Rheinbold, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York-San Francisco-London, 1970.
19. E. Panier and A. Tits, Avoiding the Maratos effect by means of a nonmonotone linesearch, I: General constrained problems, SIAM J. Numer. Anal. 28 (1991) 1183-1195.
20. P.Y. Papalambros and D.J. Wilde, Principles of Optimal Design, Cambridge University Press, 1988.
21. M.J.D. Powell, A fast algorithm for nonlinearly constrained optimization calculations,in Numerical Analysis, G.A. Watson (ed.), Lecture Notes in Mathematics, Vol. 630,Springer, 1978, pp. 144-157.
22. M.J.D. Powell, On the quadratic programming algorithm of Goldfarb and Idnani, Report DAMTP 1983/NA 19, University of Cambridge, Cambridge, 1983.
23. M. Raydan, The Barzilai and Borwein gradient method for the large-scale unconstrainedminimization problem, SIAM J. Optim. 7 (1997) 26-33.
24. R.T. Rockafellar, Augmented Lagrange multiplier functions and duality in non-convexprogramming, SIAM J. Control 12 (1974) 268-285.
25. K. Schittkowski, Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, Vol. 183, Springer-Verlag, Berlin, 1980.
26. K. Schittkowski, On the convergence of a sequential quadratic programming methodwith an augmented Lagrangian search direction, Optimization 14 (1983) 197-216.
27. K. Schittkowski, More Test Examples for Nonlinear Programming, Lecture Notes in Economics and Mathematical Systems, Vol. 182, Springer-Verlag, Berlin, 1987.
28. K. Schittkowski, Test problems for nonlinear programming - user's guide, Report,Department of Mathematics, University of Bayreuth, 2002.
29. K. Schittkowski, QL: A Fortran code for convex quadratic programming - user's guide,Report, Department of Mathematics, University of Bayreuth, 2003.
30. K. Schittkowski, NLPQLP: A Fortran implementation of a sequential quadratic programmingalgorithm with distributed and non-monotone line search - user's guide,version 2.2, Report, Department of Computer Science, University of Bayreuth, 2006.
31. P. Spellucci, Numerische Verfahren der nichtlinearen Optimierung, Birkhäuser Verlag,Basel, 1993.
32. J. Stoer, Foundations of recursive quadratic programming methods for solving nonlinearprograms, in Computational Mathematical Programming, K. Schittkowski (ed.) NATOASI Series, Series F: Computer and Systems Sciences, Vol. 15, Springer-Verlag, Berlin,1985, pp. 165-208.
33. P.L. Toint, An assessment of nonmontone line search techniques for unconstrained optimization,SIAM J. Sci. Comp. 17 (1996) 725-739.
34. Y.-X. Yuan, On the superlinear convergence of a trust region algorithm for nonsmoothoptimization, Math. Program. 31 (1985) 269-285.