default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID"Two Symmetrized Coordinate Descent Methods Can Be O(n2) Times ..."
- Peijun Xiao, Zhisheng Xiao, Ruoyu Sun:
Two Symmetrized Coordinate Descent Methods Can Be O(n2) Times Slower Than the Randomized Version. SIAM J. Optim. 31(4): 2726-2752 (2021)
Please note: Providing information about references and citations is only possible thanks to to the open metadata APIs provided by crossref.org and opencitations.net. If citation data of your publications is not openly available yet, then please consider asking your publisher to release your citation data to the public. For more information please see the Initiative for Open Citations (I4OC). Please also note that there is no way of submitting missing references or citation data directly to dblp.
Please also note that this feature is work in progress and that it is still far from being perfect. That is, in particular,
- the lists below may be incomplete due to unavailable citation data,
- reference strings may not have been successfully mapped to the items listed in dblp, and
- we do not have complete and curated metadata for all items given in these lists.
JavaScript is requires in order to retrieve and display any references and citations for this record.
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.
last updated on 2022-01-08 01:37 CET 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:
