Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/97182
Title: | PolyU 85th and AMA 50th anniversary distinguished lecture : Origins and motivations of modern variational analysis | Other Title: | Origins and motivations of modern variational analysis | Authors: | Rockafellar, Terry | Issue Date: | 2022 | Abstract: | Before the advent of computers around 1950, optimization centered either on small-dimensional problems solved by looking at zeroes of first derivatives and signs of second derivatives, or on infiniteĀ-dimensional problems about curves and surfaces. In both cases, "variations" were employed to understand how a local solution might be characterized. Computers changed the picture by opening the possibility of solving large-scale problems involving inequalities, instead of only equations. Inequalities had to be recognized as important because the decisions to be optimized were constrained by the need to respect many upper or lower bounds on their feasibility. A new kind of mathematical analysis, beyond traditional calculus, had to be developed to address these needs. It built first on appealing to the convexity of sets and functions, but went on to amazingly broad and successful concepts of variational geometry, subgradients, subderivatives, and variational convergence beyond just that. This talk will explain these revolutionary developments and why there were essential.<br>Event date: 1/11/2022<br>Speaker: Prof. Terry Rockafellar (University of Washington)<br>Hosted by: Department of Applied Mathematics | Keywords: | Convex functions Convex sets Mathematical optimization Computer science -- Mathematics |
Publisher: | Hong Kong Polytechnic University |
Appears in Collections: | Open Educational Resources |
Access
View full-text via https://oer.lib.polyu.edu.hk/concern/works/mw22v5873
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.