Related papers: An optimal first-order Taylor-like formula with a …
For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by…
We established a new eighth-order iterative method, consisting of three steps, for solving nonlinear equations. Per iteration the method requires four evaluations (three function evaluations and one evaluation of the first derivative).…
In this paper, we develop a regularized higher-order Taylor based method for solving composite (e.g., nonlinear least-squares) problems. At each iteration, we replace each smooth component of the objective function by a higher-order Taylor…
We present a new algorithm for automatically bounding the Taylor remainder series. In the special case of a scalar function $f: \mathbb{R} \to \mathbb{R}$, our algorithm takes as input a reference point $x_0$, trust region $[a, b]$, and…
Tensors, especially higher-order tensors, are typically represented in low-rank formats to preserve the main information of the high-dimensional data while saving memory space. In practice, only a small fraction elements in high-dimensional…
Linear inverse problems are ubiquitous. Often the measurements do not follow a Gaussian distribution. Additionally, a model matrix with a large condition number can complicate the problem further by making it ill-posed. In this case, the…
Based on two isomorphisms of Hopf algebras, we provide a bound in the optimal order on the remainder of the truncated Taylor expansion for controlled differential equations driven by branched rough paths.
In (Nucci M.C. 1994, Physica D 78 p.124), we have found that iterations of the nonclassical symmetries method give rise to new nonlinear equations, which inherit the Lie point symmetry algebra of the given equation. In the present paper, we…
Floating-point round-off errors are ubiquitous in numerically intensive programs arising in fields such as scientific computing and optimization. As floating-point errors potentially lead to unexpected and catastrophic program failures, one…
We propose a new integral based on Taylor measures, study its properties extensively, and we illustrate that it includes many concepts from mathematics as special cases. In particular, the new integral emerges as a generalization of the…
Motivated by recent increased interest in optimization algorithms for non-convex optimization in application to training deep neural networks and other optimization problems in data analysis, we give an overview of recent theoretical…
The main point of this paper is to present a class of equations over integers that one can check if they have a solution by checking a set of inequalities. The prototype of such equations is the equations appearing in the well-known…
This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…
In arXiv:2305.03945 [math.NA], a first-order optimization algorithm has been introduced to solve time-implicit schemes of reaction-diffusion equations. In this research, we conduct theoretical studies on this first-order algorithm equipped…
We present a method for reducing the order of ordinary differential equations satisfying a given scaling relation (Majorana scale-invariant equations). We also develop a variant of this method, aimed to reduce the degree of non-linearity of…
A linear implicit finite difference method is proposed for the approximation of the solution to a periodic, initial value problem for a Schrodinger-Hirota equation. Optimal, second order convergence in the discrete $H^1-$norm is proved,…
This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints…
Incorporating a non-Euclidean variable metric to first-order algorithms is known to bring enhancement. However, due to the lack of an optimal choice, such an enhancement appears significantly underestimated. In this work, we establish a…
We give a rigorous treatment on the foundation of the first order asymptotic theory of quantum estimation, with tractable and reasonable regularity conditions. Different from past works, we do not use Fisher information nor MLE, and an…
We consider a class of finite element approximations for fourth-order parabolic equations that can be written as a system of second-order equations by introducing an auxiliary variable. In our approach, we first solve a variational problem…