default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZheng Qu 0001
Person information
- affiliation: University of Hong Kong, Department of Mathematics, Hong Kong
- affiliation (former): University of Edinburgh, UK
Other persons with the same name
- Zheng Qu — disambiguation page
- Zheng Qu 0002 — University of California, Santa Barbara, CA, USA (and 1 more)
- Zheng Qu 0003
![[0000-0002-2453-5355]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2453-5355")
— Massachusetts Institute of Technology, Cambridge, MA, USA - Zheng Qu 0004 — University of Colorado, Boulder, CO, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Marianne Akian, Stéphane Gaubert, Zheng Qu, Omar Saadi:
Multiply Accelerated Value Iteration for NonSymmetric Affine Fixed Point Problems and Application to Markov Decision Processes. SIAM J. Matrix Anal. Appl. 43(1): 199-232 (2022)- 2021
- [j10]Xun Qian, Zheng Qu, Peter Richtárik:
L-SVRG and L-Katyusha with Arbitrary Sampling. J. Mach. Learn. Res. 22: 112:1-112:47 (2021) - [j9]Fei Li, Zheng Qu:
An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization. Math. Program. Comput. 13(3): 583-644 (2021) - 2020
- [j8]Olivier Fercoq, Zheng Qu:
Restarting the accelerated coordinate descent method with a rough strong convexity estimate. Comput. Optim. Appl. 75(1): 63-91 (2020)
2010 – 2019
- 2019
- [c11]Marianne Akian, Stéphane Gaubert, Zheng Qu, Omar Saadi:
Solving Ergodic Markov Decision Processes and Perfect Information Zero-sum Stochastic Games by Variance Reduced Deflated Value Iteration. CDC 2019: 5963-5970 - [c10]Xun Qian, Zheng Qu, Peter Richtárik:
SAGA with Arbitrary Sampling. ICML 2019: 5190-5199 - [i12]Xun Qian, Zheng Qu, Peter Richtárik:
SAGA with Arbitrary Sampling. CoRR abs/1901.08669 (2019) - 2018
- [j7]Yassamine Seladji, Zheng Qu:
Polyhedron over-approximation for complexity reduction in static analysis. Int. J. Comput. Math. Comput. Syst. Theory 3(4): 215-229 (2018) - 2017
- [j6]Stéphane Gaubert, Zheng Qu:
Checking strict positivity of Kraus maps is NP-hard. Inf. Process. Lett. 118: 35-43 (2017) - [j5]Jakub Konecný, Zheng Qu, Peter Richtárik:
Semi-stochastic coordinate descent. Optim. Methods Softw. 32(5): 993-1005 (2017) - 2016
- [j4]Stéphane Gaubert, Zheng Qu, Srinivas Sridharan:
Maximizing concave piecewise affine functions on the unitary group. Optim. Lett. 10(4): 655-665 (2016) - [j3]Zheng Qu, Peter Richtárik:
Coordinate descent with arbitrary sampling I: algorithms and complexity. Optim. Methods Softw. 31(5): 829-857 (2016) - [j2]Zheng Qu, Peter Richtárik:
Coordinate descent with arbitrary sampling II: expected separable overapproximation. Optim. Methods Softw. 31(5): 858-884 (2016) - [c9]Zeyuan Allen Zhu, Zheng Qu, Peter Richtárik, Yang Yuan:
Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling. ICML 2016: 1110-1119 - [c8]Zheng Qu, Peter Richtárik, Martin Takác, Olivier Fercoq:
SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization. ICML 2016: 1823-1832 - 2015
- [c7]Dominik Csiba, Zheng Qu, Peter Richtárik:
Stochastic Dual Coordinate Ascent with Adaptive Probabilities. ICML 2015: 674-683 - [c6]Zheng Qu, Peter Richtárik, Tong Zhang:
Quartz: Randomized Dual Coordinate Ascent with Arbitrary Sampling. NIPS 2015: 865-873 - [i11]Zheng Qu, Peter Richtárik, Martin Takác, Olivier Fercoq:
SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization. CoRR abs/1502.02268 (2015) - [i10]Dominik Csiba, Zheng Qu, Peter Richtárik:
Stochastic Dual Coordinate Ascent with Adaptive Probabilities. CoRR abs/1502.08053 (2015) - 2014
- [j1]Zheng Qu:
Contraction of Riccati Flows Applied to the Convergence Analysis of a Max-Plus Curse-of-Dimensionality-Free Method. SIAM J. Control. Optim. 52(5): 2677-2706 (2014) - [c5]Zheng Qu:
A max-plus based randomized algorithm for solving a class of HJB PDEs. CDC 2014: 1575-1580 - [c4]Olivier Fercoq, Zheng Qu, Peter Richtárik, Martin Takác:
Fast distributed coordinate descent for non-strongly convex losses. MLSP 2014: 1-6 - [i9]Stephane Gaubert, Zheng Qu:
Checking the strict positivity of Kraus maps is NP-hard. CoRR abs/1402.1429 (2014) - [i8]Olivier Fercoq, Zheng Qu, Peter Richtárik, Martin Takác:
Fast Distributed Coordinate Descent for Non-Strongly Convex Losses. CoRR abs/1405.5300 (2014) - [i7]Zheng Qu, Peter Richtárik, Tong Zhang:
Randomized Dual Coordinate Ascent with Arbitrary Sampling. CoRR abs/1411.5873 (2014) - [i6]Jakub Konecný, Zheng Qu, Peter Richtárik:
Semi-Stochastic Coordinate Descent. CoRR abs/1412.6293 (2014) - [i5]Zheng Qu, Peter Richtárik:
Coordinate Descent with Arbitrary Sampling I: Algorithms and Complexity. CoRR abs/1412.8060 (2014) - [i4]Zheng Qu, Peter Richtárik:
Coordinate Descent with Arbitrary Sampling II: Expected Separable Overapproximation. CoRR abs/1412.8063 (2014) - 2013
- [c3]Zheng Qu:
Contraction of Riccati flows applied to the convergence analysis of the max-plus curse of dimensionality free method. ECC 2013: 2226-2231 - [c2]Stephane Gaubert, Zheng Qu:
Markov operators on cones and non-commutative consensus. ECC 2013: 2693-2700 - [i3]Stéphane Gaubert, Zheng Qu:
Dobrushin ergodicity coefficient for Markov operators on cones, and beyond. CoRR abs/1302.5226 (2013) - 2012
- [i2]Stéphane Gaubert, Zheng Qu:
The contraction rate in Thompson metric of order-preserving flows on a cone - application to generalized Riccati equations. CoRR abs/1206.0448 (2012) - 2011
- [c1]Stephane Gaubert, William M. McEneaney, Zheng Qu:
Curse of dimensionality reduction in max-plus based approximation methods: Theoretical estimates and improved pruning algorithms. CDC/ECC 2011: 1054-1061 - [i1]Stephane Gaubert, William M. McEneaney, Zheng Qu:
Curse of dimensionality reduction. CoRR abs/1109.5241 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
