Related papers: Precision Studies of the NNLO DGLAP Evolution at t…
This work proposes a method for sparse polynomial chaos (PC) approximation of high-dimensional stochastic functions based on non-adapted random sampling. We modify the standard l1 -minimization algorithm, originally proposed in the context…
In this paper we introduce an evolutionary algorithm for the solution of linear integer programs. The strategy is based on the separation of the variables into the integer subset and the continuous subset; the integer variables are fixed by…
We present a new QCD evolution library for unpolarized parton distribution functions: EKO. The program solves DGLAP equations up to next-to-next-to-leading order. The unique feature of EKO is the computation of solution operators, which are…
We define a general scheme for the evolution of fragmentation functions which resums both soft gluon logarithms and mass singularities in a consistent manner and to any order, and requires no additional theoretical assumptions. Using the…
Large Language Models (LLM) have achieved remarkable performance across a large number of tasks, but face critical deployment and usage barriers due to substantial computational requirements. Model compression methods, which aim to reduce…
A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several…
We study a class of generalized linear programs (GLP) in a large-scale setting, which includes simple, possibly nonsmooth convex regularizer and simple convex set constraints. By reformulating (GLP) as an equivalent convex-concave min-max…
We present a GPU implementation of Algorithm NCL, an augmented Lagrangian method for solving large-scale and degenerate nonlinear programs. Although interior-point methods and sequential quadratic programming are widely used for solving…
While combining large language models (LLMs) with evolutionary algorithms (EAs) shows promise for solving complex optimization problems, current approaches typically evolve individual solutions, often incurring high LLM call costs. We…
Randomized numerical linear algebra - RandNLA, for short - concerns the use of randomization as a resource to develop improved algorithms for large-scale linear algebra computations. The origins of contemporary RandNLA lay in theoretical…
We propose an algorithm to find a solution to an integro-differential equation of the DGLAP type for all the orders in the running coupling $\alpha$ with splitting functions given at a fixed order in $\alpha.$ Complex analysis is…
We explain particular, unique, approximate solutions of the Dokshitzer-Gribov-Lipatov-Altarelli-Parisi (DGLAP) evolution equations and also solutions of DGLAP evolution equations by using regge behaviour of structure functions and method of…
This paper considers a general class of iterative optimization algorithms, referred to as linear-optimization-based convex programming (LCP) methods, for solving large-scale convex programming (CP) problems. The LCP methods, covering the…
A next-to-next-to-leading order (NNLO) QCD calculation of gluon distribution function at small-x is presented. The gluon distribution function is explored analytically in the DGLAP approach by a Taylor expansion at small x as two first…
We address quarkonium formation at moderate to large transverse momenta, where the single-parton collinear fragmentation prevails over the short-distance emission, directly from the hard sub-scattering, of the constituent heavy-quark pair.…
In this paper, we address the challenge of solving large-scale graph-structured nonlinear programs (gsNLPs) in a scalable manner. GsNLPs are problems in which the objective and constraint functions are associated with nodes on a graph and…
Sparse estimation for Gaussian graphical models is a crucial technique for making the relationships among numerous observed variables more interpretable and quantifiable. Various methods have been proposed, including graphical lasso, which…
The unified description of fragmentation function evolution from large to small x which was developed for the vacuum in previous publications is now generalized to the medium, and is studied for the case in which the complete contribution…
We present the current status of the application of our approach of {\it exact} amplitude-based resummation in quantum field theory to precision QCD calculations, by realistic MC event generator methods, as needed for precision LHC…
In this paper we make a study of a partial integral differential equation with $p$-Laplacian using a mixed finite element method. Two stable and convergent fixed point schemes are proposed to solve the nonlinear algebraic system. Using the…