Related papers: A stochastic optimization algorithm for analyzing …
This paper presents a state-of-the-art algorithm for the vertex enumeration problem of arrangements, which is based on the proposed new pivot rule, called the Zero rule. The Zero rule possesses several desirable properties: i) It gets rid…
The simplest solutions of the N-body problem --symmetric relative equilibria-- are shown to be organizing centers from which stem some recently studied classes of periodic solutions. We focus on the relative equilibrium of the equal-mass…
We consider a question of finding a periodic solution for the planar Newtonian N-body problem with equal masses, where each body is travelling along the same closed path. We provide a computer assisted proof for the following facts: local…
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general…
We consider an analytic way to make the interacting N-body problem tractable by using harmonic oscillators in place of the relevant two-body interactions. The two body terms of the N-body Hamiltonian are approximated by considering the…
This work is devoted to the study of some exactly solvable quantum problems of four, five and six bodies moving on the line. We solve completely the corresponding stationary Schr\"odinger equation for these systems confined in an harmonic…
The balanced configurations are those n-body configurations which admit a relative equilibrium motion in a Euclidean space E of high enough dimension 2p. They are characterized by the commutation of two symmetric endomorphisms of the…
In this paper we study the linear stability of relative equilibria in the Newtonian $n$-body problem from the viewpoint of electromagnetic systems. We first examine the effect of the ambient dimension on stability, starting from the…
The family of planar linear chains are found as collision-free action minimizers of the spatial $N$-body problem with equal masses under $D_N$ or $D_N \times \zz_2$-symmetry constraint and different types of topological constraints. This…
A solvable many-body problem in the plane is exhibited. It is characterized by rotation-invariant Newtonian (``acceleration equal force'') equations of motion, featuring one-body (``external'') and pair (``interparticle'') forces. The…
This work provides a theoretical analysis for optimally solving the pose estimation problem using total least squares for vector observations from landmark features, which is central to applications involving simultaneous localization and…
Optimal quantization for mixed distributions has emerged as a compelling area of study. In this work, we have focused on a mixed distribution formed from two uniform distributions with partially overlapping supports. For this class of…
We give a stochastic optimization algorithm that solves a dense $n\times n$ real-valued linear system $Ax=b$, returning $\tilde x$ such that $\|A\tilde x-b\|\leq \epsilon\|b\|$ in time: $$\tilde O((n^2+nk^{\omega-1})\log1/\epsilon),$$ where…
We use variational minimizing methods to study spatial restricted N+1-body problems with a zero mass moving on the vertical axis of the moving plane for N equal masses. We prove that the minimizer of the Lagrangian action on the anti-T/2 or…
In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…
This paper examines a variety of classical optimization problems, including well-known minimization tasks and more general variational inequalities. We consider a stochastic formulation of these problems, and unlike most previous work, we…
This paper focuses on investigating an inexact stochastic model-based optimization algorithm that integrates preconditioning techniques for solving stochastic composite optimization problems. The proposed framework unifies and extends the…
We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their…
This paper presents a study of the use of numerical simulation and Bayesian optimisation techniques to investigate the dynamics of celestial systems. Initially, the study focuses on Lagrange points in restricted three-body systems where a…
We propose and analyze a set of variational quantum algorithms for solving quadratic unconstrained binary optimization problems where a problem consisting of $n_c$ classical variables can be implemented on $\mathcal O(\log n_c)$ number of…