234 citations · 938 across the 65 of their papers we have counts for
Showing 2025 · math.OCShow all
2 papers · 2 filters
math.OC2025
Disciplined Biconvex Programming
Hao Zhu, Joschka Boedecker
We introduce disciplined biconvex programming (DBCP), a modeling framework for specifying and solving biconvex optimization problems. Biconvex optimization problems arise in variou…
math.OC2025
Multi-convex Programming for Discrete Latent Factor Models Prototyping
Hao Zhu, Shengchao Yan, Jasper Hoffmann +1
Discrete latent factor models (DLFMs) are widely used in various domains such as machine learning, economics, neuroscience, psychology, etc. Currently, fitting a DLFM to some datas…