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:20261025T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20260329T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20270328T020000
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.31483.field_data.0@www.diag.uniroma1.it
DTSTAMP:20260924T152013Z
CREATED:20260922T140557Z
DESCRIPTION:Abstract:For single-objective quadratic optimization problems\,
  much is known about the existence of optimal solutions and the topologica
 l properties of the image set. For instance\, in the unconstrained case\, 
 the image set is always a closed convex interval\, and either a minimizer 
 exists or the problem is unbounded from below. This situation changes subs
 tantially as soon as two or more objective functions are considered: the i
 mage set may be neither closed nor open\, and it need not be convex. Moreo
 ver\, a multiobjective problem may be unbounded from below and still have 
 efficient solutions.The aim of this talk is to contribute to a better unde
 rstanding of quadratic multiobjective optimization problems. One tool in t
 his analysis is provided by conic lifting-and-relaxation techniques\, thro
 ugh which certain nonconvex quadratic problems can be reformulated exactly
  as convex problems over suitable cones. We use such ideas to identify a c
 lass of quadratic multiobjective problems for which all nondominated point
 s are supported\, that is\, they can be obtained by weighted-sum scalariza
 tion. 
DTSTART;TZID=Europe/Paris:20261022T153000
DTEND;TZID=Europe/Paris:20261022T153000
LAST-MODIFIED:20260922T143444Z
LOCATION:Stanza B203\, DIAG
SUMMARY:Supportedness in Quadratic Multiobjective Optimization - Prof. Gabr
 iele Eichfelder
URL;TYPE=URI:https://www.diag.uniroma1.it/node/31483
END:VEVENT
END:VCALENDAR