BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Namur Institute For Complex Systems - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Namur Institute For Complex Systems
X-ORIGINAL-URL:https://www.naxys.be
X-WR-CALDESC:Events for Namur Institute For Complex Systems
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20201203T130000
DTEND;TZID=Europe/Paris:20201203T130000
DTSTAMP:20260429T054517
CREATED:20201119T091057Z
LAST-MODIFIED:20210101T154035Z
UID:853-1607000400-1607000400@www.naxys.be
SUMMARY:Greta Malaspina (University of Novi Sad\, Serbia)
DESCRIPTION:Title: A modified Levenberg-Maquardt method for large scale network adjustment \nWe present a numerical optimization approach for the solution of large scale Network Adjustment Problems that arise in localization problems such as GPS positioning\, surveying and large scale Wireless Sensors Networks localization. We consider a modification of Levenberg Marquardt method that attempts to deal with the non-convex nature of the objective function and the large number of variables.\nAt each iteration of the classical method the search direction is computed by solving a linear system of equations\, which is an expensive procedure when the number of unknowns in the problem that we consider is large\, and represents the major obstacle to the solution of realistic\, large scale\, problems. We develop a scheme for the decomposition of the linear system\, which consist in computing an approximation of the Levenberg Marquardt direction by solving a number of independent linear systems of smaller size\, and we propose a correction strategy of the right sides that improves the quality of the approximated direction while retaining separability of the linear systems. The convergence analysis of the resulting method is studied under standard regularity assumptions of the objective function. Moreover\, the algorithm we propose is tested on realistic adjustment problems and compared with Levenberg Marquardt in terms of both accuracy and computational cost. \nLink to the teams group “naXys Seminars” (unamur members) here \nLink to the seminar here
URL:https://www.naxys.be/event/greta-malaspina-university-of-novi-sad-serbia/
CATEGORIES:NAXYS Seminar
END:VEVENT
END:VCALENDAR