BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Australian Mathematical Society - ECPv5.5.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Australian Mathematical Society
X-ORIGINAL-URL:https://austms.org.au
X-WR-CALDESC:Events for Australian Mathematical Society
BEGIN:VTIMEZONE
TZID:Australia/Melbourne
BEGIN:STANDARD
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
DTSTART:20200404T160000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:20201003T160000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Australia/Melbourne:20200923T170000
DTEND;TZID=Australia/Melbourne:20200923T180000
DTSTAMP:20230323T200850
CREATED:20200923T044745Z
LAST-MODIFIED:20201110T051401Z
UID:8989-1600880400-1600884000@austms.org.au
SUMMARY:Variational Analysis and Optimisation Seminar
DESCRIPTION:Time: September 23rd\, 2020 at 05:00 PM AEST\n\n\n\nVariational Analysis and Optimisation Seminar\n\n\n\nDear colleagues\,\n\n\nThe next talk in the Variational Analysis and Optimisation Webinar series will be given by Regina Burachik on September 23rd\, 2020\, 05:00 PM AEST. Here are the details:\n\n\n(17:00 AEST = 15:00 in China = 14:00 in Vietnam = 10:00 in Israel = 9:00 in most of Europe.)\n\n\nJoin Zoom Meeting:https://uwa.zoom.us/j/98686167020?pwd=RXUveWhVVVRNWUFUazJrZUdOS2pQZz09\n\n\nPassword: 437959\n\n\nMeeting ID: 986 8616 7020\n\n\nSpeaker: Regina Burachik (UniSA)\n\n\nTalk: A Primal–Dual Penalty Method via Rounded Weighted-L1 Lagrangian Duality\n\n\nAbstract: We propose a new duality scheme based on a sequence of smooth minorants of the weighted-ℓ1 penalty function\, interpreted as a parametrized sequence of augmented Lagrangians\, to solve nonconvex constrained optimization problems. For the induced sequence of dual problems\, we establish strong asymptotic duality properties. Namely\, we show that (i) the sequence of dual problems is convex and (ii) the dual values monotonically increase to the optimal primal value. We use these properties to devise a subgradient based primal–dual method\, and show that the generated primal sequence accumulates at a solution of the original problem. We illustrate the performance of the new method with three different types of test problems: A polynomial nonconvex problem\, large-scale instances of the celebrated kissing number problem\, and the Markov–Dubins problem. Our numerical experiments demonstrate that\, when compared with the traditional implementation of a well-known smooth solver\, our new method (using the same well-known solver in its subproblem) can find better quality solutions\, i.e.\, “deeper” local minima\, or solutions closer to the global minimum. Moreover\, our method seems to be more time efficient\, especially when the problem has a large number of constraints.\n\n\nThis is a joint work with C. Y. Kaya (UniSA) and C. J. Price (University of Canterbury\, Christchurch\, New Zealand)\n\n\nPlease forward this information to anyone you think could be interested in this seminar series.\n\n\n\n\n\n\nBest regards\,\n\n\n\n\n\n\nHoa Bui (Curtin)\, Minh Dao (Federation Uni)\, Alex Kruger (Federation Uni)\, Guoyin Li (UNSW)\, Vera Roshchina (UNSW)\, Matthew Tam (UniMelb)
URL:https://austms.org.au/event/variational-analysis-and-optimisation-seminar/
LOCATION:Zoom ID 86 8616 7020
CATEGORIES:VA & Opt Webinar
END:VEVENT
END:VCALENDAR