On the superlinear convergence of a trust region algorithm for nonsmooth optimization (original) (raw)

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

1. R.H. Bartels, A.R. Conn and J.W. Sinclair, “Minimization techniques for piecewise differentiable functions: the_L_ 1 solution to an overdetermined linear system”,SIAM Journal of Numerical Analysis 15 (1978) 224–241.
   Article MATH MathSciNet Google Scholar
2. R. Fletcher, “A Fortran subroutine for general quadratic programming”, A.E.R.E. Report 6370, Harwell, England (1970).
3. R. Fletcher, “A model algorithm for composite NDO problem”,Mathematical Programming Studies 17 (1982) 67–76.
   MATH MathSciNet Google Scholar
4. R. Fletcher,Practical methods of optimization Vol. 2, Constrained optimization (John Wiley, New York, 1981).
   MATH Google Scholar
5. R. Fletcher, “Second order correction for nondifferentiable optimization”, in: G.A. Watson, ed.,Numerical analysis (Springer-Verlag, Berlin, 1982) pp. 85–114.
   Chapter Google Scholar
6. D. Goldfarb and A. Idnani, “A numerically stable dual method for solving strictly convex quadratic programs”,Mathematical Programming 27 (1983) 1–33.
   MATH MathSciNet Google Scholar
7. P.E. Gill and W. Murray,Numerical methods for constrained optimization (Academic Press, London, 1974).
   Google Scholar
8. P.E. Gill and W. Murray, “Numerically stable methods for quadratic programming”,Mathematical Programming 14 (1978) 349–372.
   Article MATH MathSciNet Google Scholar
9. P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, “Linearly constrained optimization”, in: M.J.D. Powell, ed.,Nonlinear optimization 1981 (Academic Press, London, 1982).
   Google Scholar
10. W. Murray and M.L. Overton, “A projected Lagrangian algorithm for nonlinear minmax optimization”,SIAM Journal on Scientific and Statistical Computing 1 (1980) 345–370.
    Article MATH MathSciNet Google Scholar
11. W. Murray and M.L. Overton, “A projected Lagrangian algorithm for nonlinear_L_ 1 optimization”,SIAM Journal on Scientific and Statistical Computing 2 (1981) 207–224.
    Article MATH MathSciNet Google Scholar
12. J. Nocedal and M. Overton, “Projected Hessian updating algorithms for nonlinear constrained optimization”, Report 59, Computer Science Department, New York University (November, 1983).
13. M.J.D. Powell, “A new algorithm for unconstrained optimization”, in: J.B. Rosen, O.L. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, New York, 1970).
    Google Scholar
14. M.J.D. Powell, “Convergence properties of a class of minimization algorithms”, in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear programming 2 (Academic Press, New York, 1975).
    Google Scholar
15. Y. Yuan, “Some properties of trust region algorithms for nonsmooth optimization”, Report DAMTP 1983/NA4, University of Cambridge.
16. Y. Yuan, “An example of only linear convergence of trust region algorithms for nonsmooth optimization”,IMA Journal of Numerical Analysis 4 (1984) 327–335.
    Article MATH MathSciNet Google Scholar

Download references