Talks

Conference talks

1. ICNONLA 2021, Linearly‑Constrained Nonsmooth Optimization for Training Deep Neural Network, Chengdu, China, September 2021.
2. SIAM OP23, An Inexact Augmented Lagrangian Algorithm for Training Leaky ReLU Neural Network with Group Sparsity, Seattle, US, June 2023. Organized session: Methods for constrained nonconvex problems with application to machine learning (with Ziyu He and Chuan He).
3. MOPTA 2023, First‑order Methods for Affinely Constrained Composite Non‑convex Non‑smooth Problems: Lower Complexity Bound and Near‑optimal Methods, Lehigh University, US, August 2023.
4. INFORMS Annual meeting 2023, Decentralized Methods for Composite Nonconvex Strongly‑Concave Minimax Problems, Phoenix, US, October 2023.
5. SIAM‑NNP 2023, Inexact Proximal Augmented Lagrangian Method for weakly‑Convex Problems with Convex Constraints, New Jersey Institute of Technology, Newark, NJ, October 2023. Organized session: Large‑Scale Structured Optimization (with Mateo Diaz, Benjamin Grimmer, Jiaming Liang and Yangyang Xu).
6. INFORMS Conference on Optimization 2024, Lower Complexity Bounds of First‑order Methods for Affinely Constrained Composite Nonconvex Problems, Rice University, US, 2024. Organized session: Session SunC 4 (with Negar Soheili).
7. ISMP 2024, A Near‑optimal Method for Quadratic Constrained Composite Non‑convex Non‑smooth Problems, Montréal, Canada, July 2024. Organized session: Nonsmooth nonconvex optimization with geometric structure (with Douglas Soares Goncalves and Quentin Rebjock).
8. ICCOPT 2025, A single‑loop SPIDER‑type stochastic subgradient method for expectation‑constrained nonconvex nonsmooth optimization, University of Southern California (University Park Main Campus), CA, US, July 2025.
9. APORS Youth Forum 2025, A SPIDER‑type stochastic subgradient method for expectation‑constrained nonconvex nonsmooth optimization, PolyU, Hong Kong, November 2025. Member of the organizing committee.
10. International Workshop on Applied Mathematics + AI 2025, Damped proximal Augmented Lagrangian Method for weakly‑Convex Problems with Convex Constraints, PolyU, Hong Kong, December 2025. Member of the organizing committee.
11. SIAM OP26, A SPIDER‑type stochastic subgradient method for expectation‑constrained nonconvex nonsmooth optimization, University of Edinburgh, UK, June 2026.

Invited talks

1. Beihang University, First‑order Methods for Affinely Constrained Composite Non‑convex Non‑smooth Problems: Lower Complexity Bound and Near‑optimal Methods, October 2024.
2. PolyU, A stochastic smoothing framework for nonconvex‑nonconcave min‑sum‑max problems with applications to Wasserstein distributionally robust optimization, April 2025.
3. Wuhan University, A SPIDER‑type stochastic subgradient method for expectation‑constrained nonconvex nonsmooth optimization, March 2026.