相关论文: The Riemann hypothesis and dynamics of Backtrackin…

A new variant of Newton's method - named Backtracking New Q-Newton's method (BNQN) - which has strong theoretical guarantee, is easy to implement, and has good experimental performance, was recently introduced by the third author.…

A new variant of Newton's method - named Backtracking New Q-Newton's method (BNQN) - which has strong theoretical guarantee, is easy to implement, and has good experimental performance, was recently introduced by the third author.…

In this paper, we research more in depth properties of Backtracking New Q-Newton's method (recently designed by the third author), when used to find roots of meromorphic functions. If $f=P/Q$, where $P$ and $Q$ are polynomials in 1 complex…

In this paper, by combining the algorithm New Q-Newton's method - developed in previous joint work of the author - with Armijo's Backtracking line search, we resolve convergence issues encountered by Newton's method (e.g. convergence to a…

In a recent joint work, the author has developed a modification of Newton's method, named New Q-Newton's method, which can avoid saddle points and has quadratic rate of convergence. While good theoretical convergence guarantee has not been…

In this paper, we give explicit descriptions of versions of (Local-) Backtracking Gradient Descent and New Q-Newton's method to the Riemannian setting.Here are some easy to state consequences of results in this paper, where X is a general…

Newman's conjecture (proved by Rodgers and Tao in 2018) concerns a certain family of deformations $\{\xi_t(s)\}_{t \in \mathbb{R}}$ of the Riemann xi function for which there exists an associated constant $\Lambda \in \mathbb{R}$ (called…

In this paper we apply the ideas of New Q-Newton's method directly to a system of equations, utilising the specialties of the cost function $f=||F||^2$, where $F=(f_1,\ldots ,f_m)$. The first algorithm proposed here is a modification of…

The Riemann Hypothesis is a conjecture that all non-trivial zeros of Riemann Zeta function are located on the critical line in the complex plane. Hundreds of propositions in function theory and analytic number theory rely on this…

De Bruijn and Newman introduced a deformation of the Riemann zeta function $\zeta(s)$, and found a real constant $\Lambda$ which encodes the movement of the zeros of $\zeta(s)$ under the deformation. The Riemann hypothesis (RH) is…

This paper addresses the challenge of developing efficient algorithms for large-scale nonconvex multiobjective optimization problems (MOPs). While quasi-Newton methods are effective, their traditional application to MOPs is computationally…

We propose in this paper New Q-Newton's method. The update rule is very simple conceptually, for example $x_{n+1}=x_n-w_n$ where $w_n=pr_{A_n,+}(v_n)-pr_{A_n,-}(v_n)$, with $A_n=\nabla ^2f(x_n)+\delta _n||\nabla f(x_n)||^2.Id$ and…

In this paper, we develop some basic techniques towards the Riemann hypothesis for higher rank non-abelian zeta functions of an integral regular projective curve of genus $g$ over a finite field $\mathbb F_q$. As an application of the…

Landing methods have recently emerged in Riemannian matrix optimization as efficient schemes for handling nonlinear equality constraints without resorting to costly retractions. These methods decompose the search direction into tangent and…

A damped Newton's method to find a singularity of a vector field in Riemannian setting is presented with global convergence study. It is ensured that the sequence generated by the proposed method reduces to a sequence generated by the…

We consider the problem of numerically computing a critical point of a functional $J\colon M\rightarrow R$ where $M$ is a Riemannian manifold. Due to local quadratic convergence a popular choice to solve this problem is the geometric Newton…

In this paper, we consider the composite optimization problems over the Stiefel manifold. A successful method to solve this class of problems is the proximal gradient method proposed by Chen et al. Motivated by the proximal Newton-type…

Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…

Recently, the proximal Newton-type method and its variants have been generalized to solve composite optimization problems over the Stiefel manifold whose objective function is the summation of a smooth function and a nonsmooth function. In…

In these lectures we first review the important properties of the Riemann $\zeta$-function that are necessary to understand the nature and importance of the Riemann hypothesis (RH). In particular this first part describes the analytic…