Related papers: On Multi-step BCFW Recursion Relations

Aiming at convex optimization under structural constraints, this work introduces and analyzes a variant of the Frank Wolfe (FW) algorithm termed ExtraFW. The distinct feature of ExtraFW is the pair of gradients leveraged per iteration,…

The bootstrap is a technique recently developed to get energy eigenvalues of bound states and correlation functions. There are three crucial steps - recursive equations, positivity constraints, search space. We calculate recursive equations…

In this note, we propose a novel BCFW-like recursion relation for tree-level non-linear sigma model (NLSM) amplitudes, which circumvents the computation of boundary terms by exploiting the recently discovered hidden zeros. Using this…

In this paper, we investigate a new extragradient algorithm for solving pseudomonotone equilibrium problems on Hadamard manifolds. The algorithm uses a variable stepsize which is updated at each iteration and based on some previous…

We are interested in high-order linear multistep schemes for time discretization of adjoint equations arising within optimal control problems. First we consider optimal control problems for ordinary differential equations and show loss of…

In this paper we introduce a method for resolving multi-parameter likelihoods by fixing all parameter values, but two. Evaluation of those two variables is followed by iteratively cycling through each of the parameters in turn until…

We derive general tree-level recursion relations for amplitudes which include massive propagating particles. As an illustration, we apply these recursion relations to scattering amplitudes of gluons coupled to massive scalars. We provide…

Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…

We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…

Lecture notes on Poincar\'e-invariant scattering amplitudes and tree-level recursion relations in spinor-helicity formalism. We illustrate the non-perturbative constraints imposed over on-shell amplitudes by the Lorentz Little Group, and…

A multi-step extended maximum residual Kaczmarz method is presented for the solution of the large inconsistent linear system of equations by using the multi-step iterations technique. Theoretical analysis proves the proposed method is…

Computation of the spherical harmonic rotation coefficients or elements of Wigner's d-matrix is important in a number of quantum mechanics and mathematical physics applications. Particularly, this is important for the Fast Multipole Methods…

We present a novel feature matching algorithm that systematically utilizes the geometric properties of features such as position, scale, and orientation, in addition to the conventional descriptor vectors. In challenging scenes with the…

Gradient-based Bi-Level Optimization (BLO) methods have been widely applied to handle modern learning tasks. However, most existing strategies are theoretically designed based on restrictive assumptions (e.g., convexity of the lower-level…

We present recent developments in the application of exact amplitude-based resummation methods in the confrontation between precision theory and recent experimental results. As a consequence, we argue that these methods open the way to 1\%…

The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…

We present a formalism for the calculation of multi-particle one-loop amplitudes, valid for an arbitrary number N of external legs, and for massive as well as massless particles. A new method for the tensor reduction is suggested which…

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…

In this paper, we introduce a multilevel algorithm for approximating variational formulations of symmetric saddle point systems. The algorithm is based on availability of families of stable finite element pairs and on the availability of…

We suggest a new approach for the automatic and fully numerical evaluation of one-loop scattering amplitudes in perturbative quantum field theory. We use suitably formulated dispersion relations to perform the calculation as a convolution…