Talks



Online Fisher Markets (March 4 2024, @Purdue)

Recent Computational Progress on Linear Programming Solvers and Video (February 14 2024, @Stanford LA/OPT)

"Open Questions on the Markov Decision/Game Process" - Talk in Optimization and Algorithm Design (November 29 2023, @Berkeley SIMONS)

"Beyond Classical Fisher Markets: Non-convexity and Uncertainty" - Talk in Algorithms, Approximation, and Learning in Market and Mechanism Design (November 7 2023, @Berkeley MSRI)

Simons Institute Boot-Camp Interior-Point-Methods Part II (September 1 2023, @Berkeley)

Simons Institute Boot-Camp Interior-Point-Methods Part I (September 1 2023, @Berkeley)

Optimal Diagonal Preconditioner: Theory and Practice (August 23 2023, @ICIAM Tokyo)

An Alternative to the Newton Step: Homogeneous Second-Order Descent Framework (August 18 2023, @WOEC Hong Kong)

Online Equilibrium Pricing for Stochastic Fisher Markets (August 17 2023, @Macau)

AI Models and OR Math Optimization (August 11 2023, @Beijing)

Math Optimization in Machine-Learning/Dacision-Making (June 30 2023, @HangZhou)

SOLNP+: A Zero-Order Optimization Solver (June 24 2023, @ICMSEC)

Recent Developments on Optimization Algorithms and Applications (June 21 2023, @SEM-UCAS)

Online Linear Programming: Applications and Extensions (June 20 2023, @SEM-UCAS)

An Alternative to the Newton Step: Homogeneous Second-Order Descent Method (June 2 2023, @SIOPT)

Fast Potential Reduction for LP and its Applications (May 31 2023, @SIOPT)

SOLNP+: A Derivative-Free Solver for Nonlinear Constrained Programming (May 24 2023, @CUHKSZ)

Recent Developments on Optimization Algorithms and Applications (May 11 2023, @NJU)

Mathematical Optimization in Machine Learning/Decision-Making (April 06 2023, @CUHKSZ)

Online Equilibrium Pricing for Stochastic Fisher Markets (March 31 2023, @PKU)

Optimization in Data Science and Machine Learning/Decision-Making (March 23 2023, @SUST)

Optimization in Data Science and Machine Learning/Decision-Making (March 17 2023, @AnTai, SJTU)

Mathematical Optimization in Data Science and Machine Learning/Decision-Making (March 3 2023, @HKUSTGZ, Infor Hub Distinguished Lecture)

Accelerated Second-Order Methods for Convex and Nonconvex Optimization (December 17 2022, @MIIS, CUHKSZ)

Recent Developments on (Practical) Optimization Methods for Convex and Nonconvex Optimization (November 10 2022, @Georgia Tech)

Dimension-Reduced Second-Order and Steepest Descent Methods for Optimization(November 1 2022, @ISE, Lehigh U)

Mathematical Optimization for Machine Learning and Decision(October 18 2022, @HKU Science)

Large-Scale Convex and Nonconvex Optimization in Data Science(October 14 2022 @CUHK)

Online Linear Programming: Applications and Extensions(October 6 2022 @CUHK)

DRSOM: A Dimension-Reduced Second-Order Method for Machine and Deep Learning(September 29 2022 @HKUST)

DRSOM: A Dimension-Reduced Second-Order Method for Nonconvex Optimization(September 19 2022 @Hong Kong PolyU)

New Developments of Computational Algorithms for Convex and Nonconvex Optimization(August 23 2022 @Institute of Mathematics, Hanoi)

Online Linear Programming: Applications and Extensions(August 15 2022, ISMP Plenary talk)

New Developments of Computational Algorithms for Convex and Nonconvex Optimization(July 7 2022 @S3 Optimization Workshop, NUS)

Geometric Aggregation of the Social Welfare in Online Resource Allocatio (June 21 2022 @Nanjing U)

Online LP: new applications and extensions (June 20 2022 @City U of HK)

Multi-Block ADMM and its Applications (May 19 2022 @U of Edinburgh)

Online Fisher Market in Online Resource Allocation(May 4 2022 @U of Chicago)

Geometric Aggregation of the Social Welfare Function in Resource Allocation (April 2022 @UCI)

Online Learning via Linear Programming (December 2021)

Online Learning, Social Values and Ethical Issues in Manufacturing and Services Operations Management (December 2021)

Recent Developments of Online Linear Programming (November 2021)

Multi-Block ADMM - Managing Randomness and Data Privacy in Optimization Algorithm Design (July 2021)

From 0.618 to Mathematical Optimization (June 2021)

An Efficient Steepest Descent Projection Method for Sensor Network Tracking (May 2021)

Bandits with Knapsacks via Online Linear Programming: A (Problem-Dependent) Logarithmic Regret Bound (Janurary 2021)

Optimization and Operations Research in Mitigation of a Pandemic (July 2020)

Distributionally Robust Optimization, Online Linear Programming and Markets for Public-Good Allocations (June 2020)

Optimization and Operations Research in Mitigation of a Pandemic (May 2020)

Ye' Homepage