Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chamberlain R M, Lemarechal C, Pedersen H C and Powell M J D. (1980) “The watchdog technique for forcing convergence in algorithms for constrained optimization”, University of Cambridge DAMTP Report 80/NA1.
Coleman T F and Conn A R. (1980) “Nonlinear programming via an exact penalty function: Asymptotic analysis”, University of Waterloo, Dept of Computer Science Report CS-80-30.
Conn A R and Sinclair J W. (1975) “Quadratic programming via a non-differentiable penalty function”, University of Waterloo, Dept of Combinatorics and Optimization Report CORR 75-15.
Fletcher R. (1980a) “A model algorithm for composite NDO problems”, University of Kentucky report and in Proc. Workshop on Numerical Techniques in Systems Engineering, to appear in Mathematical Programming Studies.
Fletcher R. (1980b) Practical methods of optimization, Volume 1, Unconstrained optimization”, Wiley, Chichester.
Fletcher R. (1981a) “Practical methods of optimization, Volume 2, Constrained optimization”, Wiley, Chichester.
Fletcher R. (1981b) “Numerical experiments with an L1 exact penalty function method” in “Nonlinear programming 4”, eds. O L Mangasarian, R R Meyer and S M Robinson, Academic Press, New York.
Han S P. (1981) “Variable metric methods for minimizing a class of nondifferentiable functions”, Math. Prog. 20 pp. 1–13.
Moré J J. (1978) “The Levenberg-Marquardt algorithm: implementation and theory” in “Numerical Analysis, Dundee 1977” ed. G A Watson, Lecture Notes in Mathematics 630, Springer-Verlag, Berlin.
Powell M J D. (1978) “A fast algorithm for nonlinearly constrained optimization calculations” in “Numerical Analysis, Dundee 1977”, ed. G A Watson, Lecture Notes in Mathematics 630, Springer-Verlag, Berlin.
Pshenichnyi B. N. (1978) “Nonsmooth optimization and nonlinear programming” in “Nonsmooth optimization”, eds. C Lemarechal and R Mifflin, IIASA Proceedings 3, Pergamon, Oxford.
Sargent R W H. (1974) “Reduced gradient and projection methods for nonlinear programming” in “Numerical methods for constrained optimization” eds. P E Gill and W Murray, Academic Press, London.
Sorensen D C. (1980) “Newton's method with a trust region modification” Argonne Nat. Lab. Report ANL-80-106.
Wilson R B. (1963) “A simplicial algorithm for concave programming”, PhD dissertation, Harvard University Graduate School of Business Administration.
Wolfe M A. (1978) “Extended iterative methods for the solution of operator equations”, Numer. Math., 31, pp. 153–174.
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag
About this paper
Cite this paper
Fletcher, R. (1982). Second order corrections for non-differentiable optimization. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0093151
Download citation
DOI: https://doi.org/10.1007/BFb0093151
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11199-3
Online ISBN: 978-3-540-39009-1
eBook Packages: Springer Book Archive