BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computational Optimisation Group
X-ORIGINAL-URL:http://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20190722T140000
DTEND;TZID=UTC:20190722T150000
DTSTAMP:20260505T075711
CREATED:20190703T163349Z
LAST-MODIFIED:20190703T163349Z
UID:1273-1563804000-1563807600@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: Largest Small n-Polygons: Numerical Results and Conjectured Optima
DESCRIPTION:Title: Largest Small n-Polygons: Numerical Results and Conjectured Optima \nSpeaker: János D. Pintér \nAffiliation: Department of Industrial and Systems Engineering\, Lehigh University \nLocation: 218 Huxley Building \nTime: 14:00 – 15:00 \n  \nAbstract. LSP(n)\, the largest small polygon with n vertices\, is defined as the polygon of unit diameter that\nhas maximal area A(n). Finding the configuration LSP(n) and the corresponding A(n) for even\nvalues n >= 6 is a long-standing challenge that can be also perceived as class of hard global\noptimization problems. We present numerical solution estimates for all even values 6 <= n <= 80\,\nusing the AMPL model development environment with the LGO global-local solver engine option.\nOur results are in close agreement with the results obtained by other researchers who tackled the\nproblem using exact approaches (for 6 <= n <= 20)\, and with the best results obtained using general\npurpose numerical optimization software (for selected values from the range 6 <= n <= 100). Based\non our numerical results\, we also present a regression model based estimate of {A(n)} for all even\nvalues n >= 6. \n  \nBio. János D. Pintér is a researcher and practitioner with over four decades of experience. His\ngeneral professional interests are related to Computational Optimization\, Data Analytics\, and\nOperations Research (O.R.). His more specific primary area of expertise is nonlinear optimization\,\nincluding model\, algorithm and software development\, with a range of applications.\nHe received his M.Sc. in the area of Applied Mathematics / Operations Research from\nEötvös Loránd University\, Hungary; Ph.D. in Probability Theory / Stochastic Optimization from\nMoscow State University; and D.Sc. in Mathematics / Global Optimization from the Hungarian\nAcademy of Sciences. \nAs of 2019\, Dr. Pintér wrote and edited ten books. He is also the author/co-author of more\nthan 200 journal articles\, book chapters\, proceedings contributions\, book reviews\, and research\nreports. His monograph titled Global Optimization in Action received the 2000 INFORMS\nComputing Society Prize for Research Excellence. \nAmong other professional affiliations\, he serves on the editorial board of the Journal of\nGlobal Optimization\, and he is an editor of the book series SpringerBriefs in Optimization. He also\nserved as Global Optimization vice-chair of the INFORMS Optimization Society\, and as a member\n(later chair) of the Managing Board of EUROPT. Currently\, he is a member of the Canadian and\nthe Hungarian Operations Research Societies\, INFORMS\, and EUROPT.\nHe has worked and presented lectures in about 40 countries of the Americas\, Europe\, the\nMiddle East\, and the Pacific Region. His LGO software – with links to modeling languages and\nscientific-technical computing systems – has been in use at hundreds of academic\, business\,\ngovernment\, and research organizations. \nIn 2016\, Dr. Pintér joined the Department of Industrial and Systems Engineering at Lehigh\nUniversity as a Professor of Practice. Since that time\, he has been teaching a range of O.R. related\ncourses for undergraduate and graduate students\, as well as ISE in-class and online (distance)\ncourses for healthcare engineering professionals. \n 
URL:http://optimisation.doc.ic.ac.uk/event/seminar-largest-small-n-polygons-numerical-results-and-conjectured-optima/
END:VEVENT
END:VCALENDAR