Two noise-tolerant, bound-constrained AdaGrad variants for multilevel and domain-decomposition problems are proved to find an epsilon-approximate critical point in O(epsilon^-2) iterations with high probability.
Cosmological Consequences of Unconstrained Gravity and Electromagnetism
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Motivated by the quantum description of gauge theories, we study the cosmological effects of relaxing the Hamiltonian and momentum constraints in general relativity and Gauss' law in electromagnetism. We show that the unconstrained theories have new source terms that mimic a pressureless dust and a charge density that only follows geodesics. The source terms may be the simplest explanation for dark matter and generically predict a charged component. We comment that discovery of such terms would rule out inflation and be a direct probe of the initial conditions of the universe.
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
Two noise-tolerant, bound-constrained AdaGrad variants for multilevel and domain-decomposition problems are proved to find an epsilon-approximate critical point in O(epsilon^-2) iterations with high probability.