On the complexity of steepest descent, Newton’s method and regularized Newton methods for nonconvex unconstrained optimization

ePubs

The open archive for STFC research publications

DOI	10.5286/raltr.2009023
Persistent URL	http://purl.org/net/epubs/work/49215710
Record Status	Checked
Record Id	49215710
Title	On the complexity of steepest descent, Newton’s method and regularized Newton methods for nonconvex unconstrained optimization
Contributors	C Cartis (Edinburgh U.), NIM Gould (STFC Rutherford Appleton Lab.), Toint PL (Facultes Universitaires ND de la Paix)
Abstract
Organisation	CSE , CSE-NAG , STFC
Keywords
Funding Information
Related Research Object(s):	51570
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Report	RAL Technical Reports RAL-TR-2009-023. STFC, 2009.		cgtRALTR2009023.pdf	2009