A Truncated Newton Method with Nonmonotone Line Search for Unconstrained Optimization

@inproceedings{Grippo2004ATN,
  title={A Truncated Newton Method with Nonmonotone Line Search for Unconstrained Optimization},
  author={Luigi Grippo},
  year={2004}
}
In this paper, an unconstrained minimization algorithm is defined in which a nonmonotone line search technique is employed in association with a truncated Newton algorithm. Numerical results obtained for a set of standard test problems are reported which indicate that the proposed algorithm is highly effective in the solution of illconditioned as well as of large dimensional problems. 

Citations

Publications citing this paper.
Showing 1-10 of 59 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Study on a Memory Gradient Method for the Minimization of Functions

  • J. W. CANTRELL
  • Numerical Experience with the Truncated Newton…
  • 1986

A Family of Trust-RegionBased Algorithms for Unconstrained Minimization with Strong Global Convergence Properties

  • G. A. SHULTZ, R. B. SCHNABEL, R. H. BYRD
  • SIAM Journal on Numerical Analysis,
  • 1985
1 Excerpt

A Restricted Trust Region Algorithm for Unconstrained Optimization

  • J. P. BULTEAU, J. P. VIAL
  • Journal of Optimization Theory and Applications,
  • 1985
2 Excerpts

A Nonmonotone Line Search Technique for Newton ' s Method

  • L. GRIPPO, F. LAMPARIELLO, S. LUCIDI
  • The Watchdog Technique for Forcing Convergence in…
  • 1982

Conjugate Direction Methods in Optimization, SpringerVerlag

  • M. R. I-IESTENES
  • Mathematical Programming Study,
  • 1980
1 Excerpt

Numerical Methods for Unconstrained Optimization, Van Nostrand-Reinhold

  • M. A. WOLFE
  • 1978
1 Excerpt

Similar Papers

Loading similar papers…