default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYura Malitsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Francisco J. Aragón Artacho, Yura Malitsky, Matthew K. Tam, David Torregrosa-Belén
:
Distributed forward-backward methods for ring networks. Comput. Optim. Appl. 86(3): 845-870 (2023)- [j8]Ahmet Alacaoglu, Axel Böhm, Yura Malitsky:
Beyond the Golden Ratio for Variational Inequality Algorithms. J. Mach. Learn. Res. 24: 172:1-172:33 (2023) - [j7]Yura Malitsky, Matthew K. Tam:
Resolvent splitting for sums of monotone operators with minimal lifting. Math. Program. 201(1): 231-262 (2023) - [j6]Zheng Chen, Erik G. Larsson, Carlo Fischione, Mikael Johansson, Yura Malitsky:
Over-the-Air Computation for Distributed Systems: Something Old and Something New. IEEE Netw. 37(5): 240-246 (2023) - [j5]Zheng Chen, Yura Malitsky:
Over-the-Air Computation With Multiple Receivers: A Space-Time Approach. IEEE Wirel. Commun. Lett. 12(8): 1399-1403 (2023) - [i13]Yura Malitsky, Konstantin Mishchenko:
Adaptive Proximal Gradient Method for Convex Optimization. CoRR abs/2308.02261 (2023) - [i12]Yura Malitsky, Matthew K. Tam:
A First-Order Algorithm for Decentralised Min-Max Problems. CoRR abs/2308.11876 (2023) - 2022
- [c7]Ahmet Alacaoglu, Yura Malitsky:
Stochastic Variance Reduction for Variational Inequality Methods. COLT 2022: 778-816 - [i11]Zheng Chen, Yura Malitsky:
Over-the-Air Computation with Multiple Receivers: A Space-Time Approach. CoRR abs/2208.11751 (2022) - [i10]Zheng Chen, Erik G. Larsson, Carlo Fischione, Mikael Johansson, Yura Malitsky:
Over-the-Air Computation for Distributed Systems: Something Old and Something New. CoRR abs/2211.00767 (2022) - [i9]Ahmet Alacaoglu, Axel Böhm, Yura Malitsky:
Beyond the Golden Ratio for Variational Inequality Algorithms. CoRR abs/2212.13955 (2022) - 2021
- [j4]Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher:
Forward-reflected-backward method with variance reduction. Comput. Optim. Appl. 80(2): 321-346 (2021) - [c6]Maria-Luiza Vladarean, Yura Malitsky, Volkan Cevher:
A first-order primal-dual method with adaptivity to local smoothness. NeurIPS 2021: 6171-6182 - [c5]Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher:
Convergence of adaptive algorithms for constrained weakly convex optimization. NeurIPS 2021: 14214-14225 - [i8]Ahmet Alacaoglu, Yura Malitsky:
Stochastic Variance Reduction for Variational Inequality Methods. CoRR abs/2102.08352 (2021) - [i7]Maria-Luiza Vladarean, Yura Malitsky, Volkan Cevher:
A first-order primal-dual method with adaptivity to local smoothness. CoRR abs/2110.15148 (2021) - [i6]Francisco J. Aragón Artacho, Yura Malitsky, Matthew K. Tam, David Torregrosa-Belén:
Distributed Forward-Backward Methods without Central Coordination. CoRR abs/2112.00274 (2021) - 2020
- [j3]Yura Malitsky:
Golden ratio algorithms for variational inequalities. Math. Program. 184(1): 383-410 (2020) - [j2]Yura Malitsky, Matthew K. Tam:
A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity. SIAM J. Optim. 30(2): 1451-1472 (2020) - [c4]Konstantin Mishchenko, Dmitry Kovalev, Egor Shulgin, Peter Richtárik, Yura Malitsky:
Revisiting Stochastic Extragradient. AISTATS 2020: 4573-4582 - [c3]Ahmet Alacaoglu, Yura Malitsky, Panayotis Mertikopoulos, Volkan Cevher:
A new regret analysis for Adam-type algorithms. ICML 2020: 202-210 - [c2]Yura Malitsky, Konstantin Mishchenko:
Adaptive Gradient Descent without Descent. ICML 2020: 6702-6712 - [i5]Ahmet Alacaoglu, Yura Malitsky, Panayotis Mertikopoulos, Volkan Cevher:
A new regret analysis for Adam-type algorithms. CoRR abs/2003.09729 (2020) - [i4]Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher:
Convergence of adaptive algorithms for weakly convex constrained optimization. CoRR abs/2006.06650 (2020)
2010 – 2019
- 2019
- [c1]Peter Ochs, Yura Malitsky:
Model Function Based Conditional Gradient Method with Armijo-like Line Search. ICML 2019: 4891-4900 - [i3]Yura Malitsky, Peter Ochs:
Model Function Based Conditional Gradient Method with Armijo-like Line Search. CoRR abs/1901.08087 (2019) - [i2]Konstantin Mishchenko, Dmitry Kovalev, Egor Shulgin, Peter Richtárik, Yura Malitsky:
Revisiting Stochastic Extragradient. CoRR abs/1905.11373 (2019) - [i1]Yura Malitsky, Konstantin Mishchenko:
Adaptive gradient descent without descent. CoRR abs/1910.09529 (2019) - 2018
- [j1]Yura Malitsky, Thomas Pock:
A First-Order Primal-Dual Algorithm with Linesearch. SIAM J. Optim. 28(1): 411-432 (2018)
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 21:20 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:
