Academics

On Efficiently Computable Approximate Stationarity Concepts in Bilevel Optimization

Time:Tues., 10:00-11:00 am, April 28, 2026

Venue:C654, Shuangqing Complex Building A

Organizer:/

Speaker:Anthony Man-Cho So

Modern Mathematics Lecture Series

Speaker

Anthony Man-Cho So 苏文藻

The Chinese University of Hong Kong

Time

Tues., 10:00-11:00 am, April 28, 2026

Venue

C654, Shuangqing Complex Building A

Title

On Efficiently Computable Approximate Stationarity Concepts in Bilevel Optimization

Abstract

Bilevel optimization (BO), which concerns optimal decision making in processes that involve an upper-level decision maker (the leader) and a lower-level decision maker (the follower), has attracted much interest lately due to its many applications in machine learning and signal processing. One of the current research directions is the design of efficient iterative methods with complexity guarantees for computing approximate stationary points of structured BO problems. However, existing results in this direction either make the restrictive assumption that the lower-level solution mapping is a singleton or only establish the tractability of rather weak stationarity concepts. In this talk, we introduce a new regularity property of set-valued mappings called set smoothness and show that if a BO problem has, among other things, a set-smooth lower-level solution mapping, then the task of finding an approximate Clarke stationary point of the problem is tractable. Our results significantly sharpen those in the literature and suggest several directions for further research.

About the Speaker

Anthony Man-Cho So joined The Chinese University of Hong Kong (CUHK) in 2007. He is currently Dean of the Graduate School, Acting Master of Morningside College, and Professor in the Department of Systems Engineering and Engineering Management. His research focuses on optimization theory and its applications in various areas of science and engineering, including computational geometry, machine learning, signal processing, and statistics.

Dr. So is a Fellow of IEEE and a Fellow of the Hong Kong Institution of Engineers. He is the recipient of a number of research and teaching awards, including the 2024 INFORMS Computing Society Prize, the SIAM Review SIGEST Award in 2024, the 2018 IEEE Signal Processing Society Best Paper Award, the 2015 IEEE Signal Processing Society Signal Processing Magazine Best Paper Award, the 2014 IEEE Communications Society Asia-Pacific Outstanding Paper Award, and the 2010 INFORMS Optimization Society Optimization Prize for Young Researchers, as well as the 2022 University Grants Committee (UGC) Teaching Award (General Faculty Members Category), the 2022 University Education Award, and the 2013 CUHK Vice-Chancellor’s Exemplary Teaching Award. Dr. So currently serves on the editorial boards of Journal of Global Optimization, Mathematical Programming, Mathematics of Operations Research, Open Journal of Mathematical Optimization, and Optimization Methods and Software.

DATEApril 23, 2026
SHARE
Related News
    • 0

      Beyond Second Order Methods for Nonconvex Optimization

      Kate Wenqi ZhuPh.D. Student, University of OxfordKate Wenqi Zhu is a fourth-year Ph.D. student in Applied Mathematics at the University of Oxford, under the supervision of Professor Coralia Cartis, and is fully funded by the CIMDA–Oxford Studentship. Her research focuses on leveraging higher-order information for efficient nonconvex optimization, with interests spanning computational complexit...

    • 1

      Quantum field theory: from physical concepts to math

      SpeakerNicolai Reshetikhin is a mathematical physicist working at the interface of quantum field theory, representation theory and geometry.AbstractThe talk will focused on how quantum field theory emerged as a physical theory and on how mathematical methods were evolving. This was a mutually stimulating process. Physics got a magnificent variety of mathematical tools. Mathematics got many new ...