Skip to main content
Log in

A class of nonmonotone stabilization methods in unconstrained optimization

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

This paper deals with the solution of smooth unconstrained minimization problems by Newton-type methods whose global convergence is enforced by means of a nonmonotone stabilization strategy. In particular, a stabilization scheme is analyzed, which includes different kinds of relaxation of the descent requirements. An extensive numerical experimentation is reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Moré, J.J., Sorensen, D.C. (1984): Newton's method. In: G.H. Golub, ed., Studies in Numerical Analysis. The Math. Association of America. Washington, DC, pp. 29–82

    Google Scholar 

  2. Dennis Jr., J.E., Schnabel, R.B. (1983): Numerical methods for unconstrained optimization and nonlinear equations. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

  3. Brown, A.A., Bartholomew-Biggs, M.C. (1987): Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations. Tech. Rep. No. 178, Numerical Optimization Centre, The Hatfield Polytechnic, Hatfield, UK

    Google Scholar 

  4. Polyak, B.T. (1985): Introduction to Optimization. Springer, Berlin Heidelberg New York

    Google Scholar 

  5. Shor, N.Z. (1985): Minimization methods for non-differentiable functions. Springer, Berlin Heidelberg New York

    Google Scholar 

  6. Chamberlain, R.M., Powell, M.J.D., Lemarechal, C., Pedersen, H.C. (1982): The watchdog technique for forcing convergence in algorithms for constrained optimization. Math. Prog. Study16, 1–17

    Google Scholar 

  7. Best, M.J., Bräuninger, J., Ritter, K., Robinson, S.M. (1981): A globally and quadratically convergent algorithm for general nonlinear programming problems. Computing26, 141–153

    Google Scholar 

  8. Ishutkin, V.S., Schönefeld, K. (1986): On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods. Computing37, 151–169

    Google Scholar 

  9. Grippo, L., Lampariello, F., Lucidi, S. (1986): A nonmonotone line search technique for Newton's method. SIAM J. Numer. Anal.23, 707–716

    Google Scholar 

  10. Grippo, L., Lampariello, F., Lucidi, S. (1989): A Truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl.60, 401–419

    Google Scholar 

  11. Grippo, L., Lampariello, F., Lucidi, S. (1987): Newton-type algorithms with nonmonotone line search for large-scale unconstrained optimization. Proc. of the 13th IFIP Conf. on System Modelling and Optimization, Tokyo, Japan, Aug. 31–Sept. 4, 1987

  12. Ortega, J.M., Rheinboldt, W.C. (1970): Iterative solution of nonlinear equations in several varables. Academic Press, New York

    Google Scholar 

  13. Gill, P.E., Murray, W. (1974): Newton-type methods for unconstrained and linearly constrained optimization. Mathematical Programming7, 311–350

    Google Scholar 

  14. Dembo, R.S., Steihaug, T. (1983): Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Prog.26, 190–212

    Google Scholar 

  15. Bertsekas, D.P. (1980): Constrained optimization and Lagrange multiplier methods. Academic Press, New York

    Google Scholar 

  16. Stoer, J., Bulirsch, R. (1980): Introduction to Numerical Analysis. Springer, Berlin Heidelberg New York

    Google Scholar 

  17. Schultz, G.A., Schnabel, R.B., Byrd, R.H. (1985): A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties. SIAM J. Numer. Anal.22, 47–67

    Google Scholar 

  18. Hock, W., Schittkowski, K. (1981): Test examples for nonlinear programming codes. Lectures Notes in Economics and Mathematical Systems, No. 187. Springer, Berlin Heidelberg New York

    Google Scholar 

  19. Grippo, L., Lampariello, F., Lucidi, S. (1990): A class of nonmonotone stabilization methods in unconstrained optimization. Part 1: convergence analysis. Part 2: computational experience. Technical Report, R. 290, IASI-CNR, Rome

    Google Scholar 

  20. Moré, J.J., Garbow, B.S., Hillstrom, K.E. (1981): Testing unconstrained optimization software. ACM Trans. Math. Software7, 17–41

    Google Scholar 

  21. Garg, N.K., Tapia, R.A. (1977): QDN: a variable storage algorithm for unconstrained optimization. Technical Report, Dept. Math. Sci., Rice University, Houston, TX

    Google Scholar 

  22. Grippo, L., Lampariello, F., Lucidi, S. (1990): A Quasi-Discrete Newton algorithm with a nonmonotone stabilization technique. J. Optim. Theory Appl.64, 485–500

    Google Scholar 

  23. Panier, E.R., Tits, A.L. (1989): Avoiding the Maratos effect by means of a nonmonotone line search: I. General constrained problems. System Research Center, University of Maryland, Technical Report SRC-TR-89-41

  24. Bonnans, J.F., Panier, E.R., Tits, A.L. (1989): Avoiding the Maratos effect by means of a nonmonotone line search: II. Inequality constrained problems—Feasible iterates. System Research Center, University of Maryland, Technical Report SRC-TR-89-42

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grippo, L., Lampariello, F. & Lucidi, S. A class of nonmonotone stabilization methods in unconstrained optimization. Numer. Math. 59, 779–805 (1991). https://doi.org/10.1007/BF01385810

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01385810

Mathematics Subject Classification (1991)

Navigation