Curse of dimensionality reduction in max-plus based approximation methods: Theoretical estimates and improved pruning algorithms. - Stephane Gaubert; William M. McEneaney; Zheng Qu 001 (CDC/ECC, 2011)

Curse of dimensionality reduction - Stephane Gaubert; William M. McEneaney; Zheng Qu 001 (CoRR, 2011)

The contraction rate in Thompson metric of order-preserving flows on a cone - application to generalized Riccati equations - Stéphane Gaubert; Zheng Qu 001 (CoRR, 2012)

Markov operators on cones and non-commutative consensus. - Stephane Gaubert; Zheng Qu 001 (ECC, 2013)

Dobrushin ergodicity coefficient for Markov operators on cones, and beyond - Stéphane Gaubert; Zheng Qu 001 (CoRR, 2013)

A max-plus based randomized algorithm for solving a class of HJB PDEs. - Zheng Qu 001 (CDC, 2014)

Fast distributed coordinate descent for non-strongly convex losses. - Olivier Fercoq; Zheng Qu 001; Peter Richtárik; Martin Takác 001 (MLSP, 2014)

Randomized Dual Coordinate Ascent with Arbitrary Sampling. - Zheng Qu 001; Peter Richtárik; Tong Zhang 001 (CoRR, 2014)

Contraction of Riccati Flows Applied to the Convergence Analysis of a Max-Plus Curse-of-Dimensionality-Free Method. - Zheng Qu 001 (SIAM J. Control. Optim., 2014)

Stochastic Dual Coordinate Ascent with Adaptive Probabilities. - Dominik Csiba; Zheng Qu 001; Peter Richtárik (ICML, 2015)

Quartz: Randomized Dual Coordinate Ascent with Arbitrary Sampling. - Zheng Qu 001; Peter Richtárik; Tong Zhang 001 (NIPS, 2015)

SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization. - Zheng Qu 001; Peter Richtárik; Martin Takác 001; Olivier Fercoq (ICML, 2016)

Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling. - Zeyuan Allen Zhu; Zheng Qu 001; Peter Richtárik; Yang Yuan (ICML, 2016)

Maximizing concave piecewise affine functions on the unitary group. - Stéphane Gaubert; Zheng Qu 001; Srinivas Sridharan (Optim. Lett., 2016)

Coordinate descent with arbitrary sampling I: algorithms and complexity. - Zheng Qu 001; Peter Richtárik (Optim. Methods Softw., 2016)

Coordinate descent with arbitrary sampling II: expected separable overapproximation. - Zheng Qu 001; Peter Richtárik (Optim. Methods Softw., 2016)

Checking strict positivity of Kraus maps is NP-hard. - Stéphane Gaubert; Zheng Qu 001 (Inf. Process. Lett., 2017)

Semi-stochastic coordinate descent. - Jakub Konecný; Zheng Qu 001; Peter Richtárik (Optim. Methods Softw., 2017)

Polyhedron over-approximation for complexity reduction in static analysis. - Yassamine Seladji; Zheng Qu 001 (Int. J. Comput. Math. Comput. Syst. Theory, 2018)

Solving Ergodic Markov Decision Processes and Perfect Information Zero-sum Stochastic Games by Variance Reduced Deflated Value Iteration. - Marianne Akian; Stéphane Gaubert; Zheng Qu 001; Omar Saadi (CDC, 2019)

SAGA with Arbitrary Sampling. - Xun Qian; Zheng Qu 001; Peter Richtárik (ICML, 2019)

Restarting the accelerated coordinate descent method with a rough strong convexity estimate. - Olivier Fercoq; Zheng Qu 001 (Comput. Optim. Appl., 2020)

L-SVRG and L-Katyusha with Arbitrary Sampling. - Xun Qian; Zheng Qu 001; Peter Richtárik (J. Mach. Learn. Res., 2021)

An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization. - Fei Li; Zheng Qu 001 (Math. Program. Comput., 2021)

Multiply Accelerated Value Iteration for NonSymmetric Affine Fixed Point Problems and Application to Markov Decision Processes. - Marianne Akian; Stéphane Gaubert; Zheng Qu 001; Omar Saadi (SIAM J. Matrix Anal. Appl., 2022)