BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20191027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20190331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.18222.field_data.0@www.glad.uniroma1.it
DTSTAMP:20260403T174204Z
CREATED:20190719T234506Z
DESCRIPTION:The well-known class of conjugate gradient (CG) line search met
 hods for large-scale unconstrained optimization will be analyzed and simpl
 e examples will be used for illustrations. To impose certain useful proper
 ties to this class\, some recent techniques will be introduced to this cla
 ss. It will be shown\, in particular\, that certain techniques enforced th
 e global convergence property to most members of the CG class of methods. 
 Some results for a selection of CG algorithms and their modifications (in 
 particular those of Fletcher-Reeves\, Polak-Ribie’re and Hestenes-Stiefel 
 methods) will be described. It will be shown that the proposed techniques 
 improve the performance of several CG algorithms substantially. 
DTSTART;TZID=Europe/Paris:20190723T150000
DTEND;TZID=Europe/Paris:20190723T150000
LAST-MODIFIED:20200521T204012Z
LOCATION:DIAG Aula A3
SUMMARY:On Recent Modifications of Conjugate Gradient Algorithms for Large-
 Scale Unconstrained Optimization - Mehiddin Al-Baali Department of Mathema
 tics\, Sultan Qaboos University\, Muscat\, Oman
URL;TYPE=URI:http://www.glad.uniroma1.it/node/18222
END:VEVENT
END:VCALENDAR