Related papers: High degree quadrature rules with pseudorandom rat…
This work introduces the nested-set Hessian approximation, a second-order approximation method that can be used in any derivative-free optimization routine that requires such information. It is built on the foundation of the generalized…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
We introduce a new rule-based optimization method for classification with constraints. The proposed method leverages column generation for linear programming, and hence, is scalable to large datasets. The resulting pricing subproblem is…
We introduce a new method for building higher-degree sum-of-squares lower bounds over the hypercube $\mathbf{x} \in \{\pm 1\}^N$ from a given degree 2 lower bound. Our method constructs pseudoexpectations that are positive semidefinite by…
Within the Correlated Gaussian Method the parameters of the Gaussian basis functions are often chosen stochastically using pseudo-random sequences. We show that alternative low-discrepancy sequences, also known as quasi-random sequences,…
A new approach of the QCD sum rule is proposed in which positive and negative-parity baryons couple with each other. With positive and negative-parity states explicitly taken into account, sum rules are derived by means of the dispersion…
In the framework of supervised classification (discrimination) for functional data, it is shown that the optimal classification rule can be explicitly obtained for a class of Gaussian processes with "triangular" covariance functions. This…
We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…
Proposed is a new formal approach for solution of extreme multi-criteria problems transforming them into single-criterion mathematical models, without any additional information. Transforming rules are based on comparison standards and…
Analysing the cubic sectors of a real polynomial of degree n, a modification of the Newton Rule is Signs is proposed with which stricter upper bound on the number of real roots can be found. A new necessary condition for reality of the…
Neural Networks have been widely used to solve Partial Differential Equations. These methods require to approximate definite integrals using quadrature rules. Here, we illustrate via 1D numerical examples the quadrature problems that may…
We apply the generalized conditional gradient algorithm to potential mean field games and we show its well-posedeness. It turns out that this method can be interpreted as a learning method called fictitious play. More precisely, each step…
Rational approximations are introduced and studied in granular graded rough sets and generalizations thereof by the first author in recent research papers. The concept of rationality is determined by related ontologies and coherence between…
Gaussian quadrature rules are a classical tool for the numerical approximation of integrals with smooth integrands and positive weight functions. We derive and expicitly list asymptotic expressions for the points and weights of Gaussian…
We construct a model of expert prediction where predictions can influence the state of the world. Under this model, we show through theoretical and numerical results that proper scoring rules can incentivize experts to manipulate the world…
We introduce deterministic perturbation schemes for the recently proposed random directions stochastic approximation (RDSA) [17], and propose new first-order and second-order algorithms. In the latter case, these are the first second-order…
A class of restarted randomized surrounding methods are presented to accelerate the surrounding algorithms by restarted techniques for solving the linear equations. Theoretical analysis prove that the proposed method converges under the…
We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.
We use difference sets to construct interesting sets of lines in complex space. Using (v,k,1)-difference sets, we obtain k^2-k+1 equiangular lines in C^k when k-1 is a prime power. Using semiregular relative difference sets with parameters…
We construct least squares formulations of PDEs with inhomogeneous essential boundary conditions, where boundary residuals are not measured in unpractical fractional Sobolev norms, but which formulations nevertheless are shown to yield a…