Uniform rank gradient, cost, and local-global convergence
DOI10.1090/TRAN/8008zbMATH Open1480.20107arXiv1710.10431OpenAlexW2997501832MaRDI QIDQ5218237FDOQ5218237
Authors: Miklós Abért, László Márton Tóth
Publication date: 2 March 2020
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.10431
Recommendations
- Universal gradient methods for convex optimization problems
- scientific article; zbMATH DE number 2196505
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
- Convergence of Gradient Descent for Low-Rank Matrix Approximation
- Uniform approximation: The non-locally convex case
- Fast gradient methods for uniformly convex and weakly smooth problems
- A uniform gradient bound of minimizers of regularized functionals
- scientific article; zbMATH DE number 1778080
- A framework for globally convergent algorithms using gradient bounding functions
- Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization
Residual properties and generalizations; residually finite groups (20E26) Generators, relations, and presentations of groups (20F05) Asymptotic properties of groups (20F69) General groups of measure-preserving transformations and dynamical systems (37A15) Chains and lattices of subgroups, subnormal subgroups (20E15)
Cites Work
- Global aspects of ergodic group actions
- Ergodic theory of amenable group actions. I: The Rohlin lemma
- Amenability, Kazhdan's property T, strong ergodicity and invariant means for ergodic group-actions
- Expanders, rank and graphs of groups
- Dynamical properties of profinite actions
- Bernoulli actions are weakly contained in any free action
- Limits of locally-globally convergent graph sequences
- Sparse graphs: metrics and random models
- Cost of equivalence relations and groups
- The rank gradient from a combinatorial viewpoint.
- Rank gradient, cost of groups and the rank versus Heegaard genus problem
- The combinatoral cost
- Rank, combinatorial cost, and homology torsion growth in higher rank lattices
- Non-standard limits of graphs and some orbit equivalence invariants
Cited In (6)
- Rank gradient and \(p\)-gradient of amalgamated free products and HNN extensions.
- Asymptotic invariants of lattices in locally compact groups
- The rank gradient from a combinatorial viewpoint.
- Point processes, cost, and the growth of rank in locally compact groups
- Non-standard limits of graphs and some orbit equivalence invariants
- On a curious problem and what it lead to
This page was built for publication: Uniform rank gradient, cost, and local-global convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5218237)