相关论文: Robust formula for $N$-point Pad\'e approximant ca…

Advances in the variational approach to the $n$-body problem have led to significant progress in celestial mechanics, uncovering new types of possible orbits. In this paper, critical points of the Lagrangian action associated with the…

Let $P$ be a polygonal curve in $\mathbb{R}^d$ of length $n$, and $S$ be a point-set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that the Fr\'echet distance from $P$ is less than a…

We study the knapsack problem with graph theoretic constraints. That is, we assume that there exists a graph structure on the set of items of knapsack and the solution also needs to satisfy certain graph theoretic properties on top of…

In recent years, numerous vision and learning tasks have been (re)formulated as nonconvex and nonsmooth programmings(NNPs). Although some algorithms have been proposed for particular problems, designing fast and flexible optimization…

The use of approximants of Pad\`e type are employed to develop a method aimed at opening new perspectives in the theory of Appell polynomials $a_n(x)$, specified by the generating function \sum_{n=0}^{\infty} \frac{t^n}{n!} a_n(x) = A(t)…

Planes are generally used in 3D reconstruction for depth sensors, such as RGB-D cameras and LiDARs. This paper focuses on the problem of estimating the optimal planes and sensor poses to minimize the point-to-plane distance. The resulting…

The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points.…

The fluctuations of proton multiplicity in heavy-ion collisions are the key observables in the search for the QCD critical point. In this work we present an approach to constraining the cumulants of proton number based on the analytical…

The closest pair problem (CPP) is one of the well studied and fundamental problems in computing. Given a set of points in a metric space, the problem is to identify the pair of closest points. Another closely related problem is the fixed…

We consider a variety of NP-Complete network connectivity problems. We introduce a novel dual-based approach to approximating network design problems with cut-based linear programming relaxations. This approach gives a $3/2$-approximation…

The development of a satisfying and rigorous mathematical understanding of the performance of neural networks is a major challenge in artificial intelligence. Against this background, we study the expressive power of neural networks through…

In path-following methods for conic programming knowledge of the performance of the (damped) Newton method at finite distances from the minimizer of a self-concordant function is crucial for the tuning of the parameters of the method. The…

Consider the following optimization problem: Given $n \times n$ matrices $A$ and $\Lambda$, maximize $\langle A, U\Lambda U^*\rangle$ where $U$ varies over the unitary group $\mathrm{U}(n)$. This problem seeks to approximate $A$ by a matrix…

Pad\'e approximations and Siegel's lemma are widely used tools in Diophantine approximation theory. This work has evolved from the attempts to improve Baker-type linear independence measures, either by using the Bombieri-Vaaler version of…

We develop a short-step interior point method to optimize a linear function over a convex body assuming that one only knows a membership oracle for this body. The approach is based on Abernethy and Hazan's sketch of a universal interior…

In this paper, we study the problem of finding the Euclidean distance to a convex cone generated by a set of discrete points in $\mathbb{R}^n_+$. In particular, we are interested in problems where the discrete points are the set of feasible…

We show the equivalence between the three approximation schemes for self-interacting (1+1)-D scalar field theories. Based on rigorous results of [1, 2], we are able to prove that the Gaussian approximation is very precise for certain limits…

Binary quadratic programming problems have attracted much attention in the last few decades due to their potential applications. This type of problems are NP-hard in general, and still considered a challenge in the design of efficient…

In this paper, we obtain the analytical solutions of two kinds of transcendental equations with numerous applications in college physics by means of Lagrange inversion theorem, and rewrite them in the form of ratio of rational polynomials…

Pade approximants are used to find approximate vortex solutions of any winding number in the context of Gross-Pitaevskii equation for a uniform condensate and condensates with axisymmetric trapping potentials. Rational function and…