3 papers
math.OC2026
A New Decomposition Paradigm for Graph-structured Nonlinear Programs via Message Passing
Kuangyu Ding, Marie Maros, Gesualdo Scutari
We study finite-sum nonlinear programs with localized variable coupling encoded by a (hyper)graph. We introduce a graph-compliant decomposition framework that brings message passin…
math.OC2025
On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
Kuangyu Ding, Kim-Chuan Toh
We study a nonsmooth nonconvex optimization problem defined over nonconvex constraints, where the feasible set is given by the intersection of the closure of an open set and a smoo…
cs.LG2024
Memory-Efficient 4-bit Preconditioned Stochastic Optimization
Jingyang Li, Kuangyu Ding, Kim-Chuan Toh +1
Preconditioned stochastic optimization algorithms, exemplified by Shampoo, outperform first-order optimizers by offering theoretical convergence benefits and practical gains in lar…