Moderate deviations in a random graph and for the spectrum of Bernoulli random matrices.
Standard algorithms for numerical integration are defined for simple integrals. Formulas for computation of repeated integrals and derivatives for equidistant domain partition based on modified Newton-Cotes formulas are derived. We compare usage of the new formulas with the classical quadrature formulas and discuss possible application of the results to solving higher order differential equations.
Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstrained optimization are considered, which consist in corrections of the used difference vectors (derived from the idea of conjugate directions), utilizing information from the preceding iteration. For quadratic objective functions, the improvement of convergence is the best one in some sense and all stored difference vectors are conjugate for unit stepsizes. The algorithm is globally convergent for convex sufficiently...
We propose a modification of the golden ratio algorithm for solving pseudomonotone equilibrium problems with a Lipschitz-type condition in Hilbert spaces. A new non-monotone stepsize rule is used in the method. Without such an additional condition, the theorem of weak convergence is proved. Furthermore, with strongly pseudomonotone condition, the $R$-linear convergence rate of the method is established. The results obtained are applied to a variational inequality problem, and the convergence rate...