Related papers: Computational Algorithm for Orbit and Mass Determi…
We propose a unique scheme to construct fully optimized atomic basis sets for density-functional calculations. The shapes of the radial functions are optimized by minimizing the {\it spillage} of the wave functions between the atomic…
Let G be a compact group acting in a real vector space V. We obtain a number of inequalities relating the L^infinity norm of a matrix element of the representation of G with its L^p norm for p<infinity. We apply our results to obtain…
This paper focuses on regularisation methods using models up to the third order to search for up to second-order critical points of a finite-sum minimisation problem. The variant presented belongs to the framework of [3]: it employs random…
We present new orbital solutions for 15 binaries, which were astrometrically measured during 2010-2013. We observe the binary systems using the FastCam ``lucky-imaging'' camera, installed at the 1.5-m Carlos S\'anchez Telescope (CST) at the…
In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove…
We present the results of a spectroscopic campaign on eclipsing binaries with long orbital period (P = 20 - 75 d) carried out with the CHIRON spectrograph. Physical and orbital solutions for seven systems were derived from the V-band, and…
We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. The algorithm can be seen as an analogue of quantum annealing under the restriction of a product state space, where…
For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We present an algorithm for solving a special…
We present an algorithm for approximately solving bounded convex vector optimization problems. The algorithm provides both an outer and an inner polyhedral approximation of the upper image. It is a modification of the primal algorithm…
In this paper, we present an exact algorithm for optimizing two linear fractional over the efficient set of a multi-objective integer quadratic problem. This type of problems arises when two decision-makers, such as firms, each have a…
The period, mass ratio, eccentricity, and other orbital parameters are fundamental for investigating binary star evolution. However, the number of binaries with known orbital parameters remains limited. Utilizing the LAMOST-MRS survey, we…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
We introduce a method for solving a self consistent electronic calculation within localized atomic orbitals, that allows us to converge to the complete basis set (CBS) limit in a stable, controlled, and systematic way. We compare our…
Most methods of orbit determination are often difficult for numerical implementations since they are developed before the computer era. The recently developed mathematical technique of semi-definite programming (SDP) has been implemented…
A class of algorithms for the solution of discrete material optimization problems in electromagnetic applications is discussed. The idea behind the algorithm is similar to that of the sequential programming. However, in each major iteration…
Our work aims to estimate the camera motion mounted on the head of a mobile robot or a moving object from RGB-D images in a static scene. The problem of motion estimation is transformed into a nonlinear least squares function. Methods for…
[ABRIDGED] We present the results of a 3 year monitoring program of a sample of very low mass (VLM) field binaries using both astrometric and spectroscopic data obtained in conjunction with the laser guide star adaptive optics system on the…
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…
An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain…