Nonmonotonic projected algorithm with both trust region and line search for constrained optimization

Journal of Computational and Applied Mathematics

Volumn 117, Issue 1, 2000, Pages 35-60

  Zhu, Detong ^a  

^a SHANGHAI NORMAL UNIVERSITY   (China)

Author keywords

65K05; 90C30; Constrained optimization; Fletcher's penalty function; Line search; Nonmonotonic technique; Trust region

Indexed keywords

CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; OPTIMIZATION;

FLETCHER PENALTY FUNCTION; HESSIAN METHODS; NONMONOTONIC PROJECTED ALGORITHMS;

ALGORITHMS;

EID: 0033738055     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(99)00327-1     Document Type: Article

References (17)

1. Byrd R.H., Schnable R.B., Shultz G.A. A trust region algorithm for nonlinearly constrained optimization. SIAM J. Numer. Anal. 24:1987;1152-1170.
2. M.R. Celis, J.E. Dennis, R.A. Tapia, A trust region strategy for nonlinear equality constrained optimization, in: P. Boggs et al. (Eds.), Numerical Optimization, SIAM, Philadelphia, 1985 , pp. 71-82.
3. Coleman T.F., Conn A.R. On the local convergence of a quasi-Newton method for the nonlinear programming problem. SIAM J. Numer. Anal. 21:1984;755-769.
4. Dennis J.E.Jr., Mei H. Two new unconstrained optimization algorithms which use function and gradient values. J. Optim. Theory Appl. 28:1979;453-482.
5. J.E.Jr. Dennis, R.B. Schnable, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, New Jersey, 1983.
6. Fontecilla R. Local convergence of secant methods for nonlinear constrained optimization. SIAM J. Numer. Anal. 25:1988;692-712.
7. Fontecilla R., Steihaug T., Tapia R. A convergence theory for a class of quasi-Newton methods for constrained optimization. SIAM J. Numer. Anal. 24:1987;1133-1152.
8. Forsgren A., Gill P.E., Murray W. Computing modified Newton directions using a partial Cholesky factorization. SIAM J. Sci. Comput. 16:1995;139-150.
9. Grippo L., Lampariello F., Lucidi S. A nonmonotonic line search technique for Newton's methods. SIAM J. Numer. Anal. 23:1986;707-716.
10. Nocedal J., Overton M.L. Projected Hessian updating algorithms for nonlinearly constrained optimization. SIAM J. Numer. Anal. 22:1985;821-850.
11. M.J.D. Powell, A hybrid method for nonlinear equations, in: P. Rabinowitz (Ed.), Numerical Methods for Nonlinear Algebraic Equations, Gordon and Breach, London, 1970 , pp. 87-114.
12. Powell M.J.D., Yuan Y. A recursive quadratic programming algorithm that uses differentiable exact penalty functions. Math. Programming. 35:1986;265-278.
13. M.J.D. Powell, Y. Yuan, A trust region algorithm for equality constrained optimization, Report DAMTP 1986 / NA2, Cambridge, England.
14. Tapia R. On secant updates for use in general constrained optimization. Math. Comp. 51:1988;181-202.
15. Zhang J., Zhu D. Projected quasi-Newton algorithm with trust region for constrained optimization. J. Optim. Theory Appl. 67:1990;369-393.
16. Zhang J., Zhu D. A convergence secant method for constrained optimization. Japan J. Ind. Appl. Math. 11:1990;265-288.
17. D. Zhu, J. Zhang, A curvilinear typed trust region with nonmonotonic back tracking technique, Research Report MA-95-22, City University of Hong Kong, 1995 .