activity
20082026
most citedA Dynamic Near-Optimal Algorithm for Online Linear Programming

35 citations · 84 across the 9 of their papers we have counts for

collaborators

9 papers

cs.GT2026

Rationalizing collective revealed preferences with an application in fair resource allocation

Chuwen Zhang, Zhiyun Guo, Zizhuo Wang +1

This paper presents a revealed preference approach for rationalizing collective consumption behavior. We introduce the Constructive Rationalization Method (CRM), which approximates…

math.OC2022★ 8 cited

Cardinal Optimizer (COPT) User Guide

Dongdong Ge, Qi Huangfu, Zizhuo Wang +2

Cardinal Optimizer is a high-performance mathematical programming solver for efficiently solving largescale optimization problem. This documentation provides basic introduction to…

math.OC2015★ 13 cited

Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions

Yichen Chen, Dongdong Ge, Mengdi Wang +3

Consider the regularized sparse minimization problem, which involves empirical sums of loss functions for data points (each of dimension ) and a nonconvex sparsity penalty.…

math.OC2013★ 6 cited

Likelihood Robust Optimization for Data-driven Problems

Zizhuo Wang, Peter Glynn, Yinyu Ye

We consider optimal decision-making problems in an uncertain environment. In particular, we consider the case in which the distribution of the input is unknown, yet there is abunda…

cs.CC2011★ 3 cited

Complexity of Unconstrained L_2-L_p Minimization

Xiaojun Chen, Dongdong Ge, Zizhuo Wang +1

We consider the unconstrained - minimization: find a minimizer of for given , and parameters , …

cs.LG2011★ 16 cited

Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems

Zizhuo Wang, Shiming Deng, Yinyu Ye

We consider a retailer selling a single product with limited on-hand inventory over a finite selling season. Customer demand arrives according to a Poisson process, the rate of whi…