相关论文: The Orbit-Sum Method for Higher Order Equations
The rotation averaging problem is a fundamental task in computer vision applications. It is generally very difficult to solve due to the nonconvex rotation constraints. While a sufficient optimality condition is available in the literature,…
We present a novel algorithm which can overcome the drawbacks of the conventional linear scaling method with minimal computational overhead. This is achieved by introducing additional constraints, thus eliminating the redundancy of the…
This work considers minimizing a sum of convex functions, each with potentially different structure ranging from nonsmooth to smooth, Lipschitz to non-Lipschitz. Nesterov's universal fast gradient method provides an optimal black-box…
We study finite-sum non-convex optimization $\min_{x\in\mathbb{R}^d} F(x) \;=\; \frac{1}{n}\sum_{i=1}^n f_i(x)$ and analyze a variance-reduced cubic Newton method based on EMA-smoothed SARAH estimators for both gradient and Hessian…
Separation of variables by means of the orbit method is implemented to integrable systems on coadjoint orbits in an $\mathfrak{sl}(4)$ loop algebra. This is a development and a kind of explanation for Sklyanin's procedure of separation of…
This paper is the first application of the compensation approach to counting problems. We discuss how this method can be applied to a general class of walks in the quarter plane $Z_{+}^{2}$ with a step set that is a subset of…
When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous questions and structures in physics, mathematics, computer…
This paper introduces a novel and general algorithm for approximately counting the number of orbits under group actions. The method is based on combining the Burnside process and importance sampling. Specializing to unitriangular groups…
We consider the minimization problem of a sum of a number of functions having Lipshitz $p$-th order derivatives with different Lipschitz constants. In this case, to accelerate optimization, we propose a general framework allowing to obtain…
In this paper, we propose an algorithm combining the forward-backward splitting method and the alternative projection method for solving the system of splitting inclusion problem. We want to find a point in the interception of a finite…
Parallel and cyclic projection algorithms are proposed for minimizing the sum of a finite family of convex functions over the intersection of a finite family of closed convex subsets of a Hilbert space. These algorithms are of…
We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…
This paper introduces a new method for the efficient computation of oscillatory multidimensional lattice sums in geometries with boundaries. Such sums are ubiquitous in both pure and applied mathematics, and have immediate applications in…
We present a new linear scaling method for the energy minimization step of semiempirical and first-principles Hartree-Fock and Kohn-Sham calculations. It is based on the self-consistent calculation of the optimum localized orbitals of any…
A new Runge-Kutta-Nystr\"om method, with phase-lag of order infinity, for the integration of second-order periodic initial-value problems is developed in this paper. The new method is based on the Dormand and Prince Runge-Kutta-Nystr\"om…
We present the OptiBounce algorithm, a new and fast method for finding the bounce action for cosmological phase transitions. This is done by direct solution of the "reduced" minimisation problem proposed by Coleman, Glaser, and Martin. By…
We present new classical and quantum algorithms for solving random subset-sum instances. First, we improve over the Becker-Coron-Joux algorithm (EUROCRYPT 2011) from $\tilde{\mathcal{O}}(2^{0.291 n})$ downto $\tilde{\mathcal{O}}(2^{0.283…
The exchange-correlation energy in Kohn-Sham density functional theory is expressed as a functional of the electronic density and the Kohn-Sham orbitals. An alternative to Kohn-Sham theory is to express the energy as a functional of the…
We present a non-canonically symplectic integration scheme tailored to numerically computing the post-Newtonian motion of a spinning black-hole binary. Using a splitting approach we combine the flows of orbital and spin contributions. In…
We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are…