Lipschitz Optimization
Lipschitz Optimization is a global optimization method that exploits the Lipschitz continuity condition to bound the function variation and systematically narrow the search space for the global optimum.
223
Publications
12.8K
Citations
464
Authors
226
Institutions
Publications per year
2017–2026
89
Parents
223
Improved Training of Wasserstein GANs
Ishaan Gulrajani, Faruk Ahmed, Martín Arjovsky et al. · arXiv (Cornell University) · 2017 · 1.5K citations · Full text
Multi-armed bandits in metric spaces
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal · 2008 · 337 citations
Virtual landmarks for the internet
Liying Tang, Mark Crovella · 2003 · 299 citations
1–5 of 223
464
10
h-index
10
h-index
6
h-index
5
h-index
4
h-index
1–5 of 464
226
Microsoft (United States)
Redmond, United States
8 h-index
8 publications
533 citations

University of Calabria
Rende, Italy
8 h-index
15 publications
611 citations

Vilnius University
Vilnius, Lithuania
8 h-index
15 publications
469 citations
Google (United States)
Mountain View, United States
6 h-index
9 publications
1.9K citations
University of California, Berkeley
Berkeley, United States
6 h-index
9 publications
142 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
9 publications
198 citations
Stanford University
Stanford, United States
5 h-index
8 publications
163 citations
N. I. Lobachevsky State University of Nizhny Novgorod
Nizhny Novgorod, Russia
4 h-index
9 publications
343 citations
1–8 of 226
Repository · 29 publications · 2.5K citations
19
h-index
13 publications · 957 citations
13
h-index
11 publications · 2.4K citations
11
h-index
9 publications · 263 citations
9
h-index
8 publications · 287 citations
8
h-index
1–5