Related papers: A modified BFGS quasi-Newton iterative formula
The standard L-BFGS method relies on gradient approximations that are not dominated by noise, so that search directions are descent directions, the line search is reliable, and quasi-Newton updating yields useful quadratic models of the…
In this work we introduce and study novel Quasi Newton minimization methods based on a Hessian approximation Broyden Class-\textit{type} updating scheme, where a suitable matrix $\tilde{B}_k$ is updated instead of the current Hessian…
While quantum computing provides an exponential advantage in solving system of linear equations, there is little work to solve system of nonlinear equations with quantum computing. We propose quantum Newton's method (QNM) for solving…
We consider a modified Klein-Gordon equation that arises at ultra high energies. In a suitable approximation it is shown that for the linear potential which is of interest in quark interactions, their confinement for example,we get…
In this paper we study stochastic quasi-Newton methods for nonconvex stochastic optimization, where we assume that only stochastic information of the gradients of the objective function is available via a stochastic first-order oracle…
The popular BFGS quasi-Newton minimization algorithm under reasonable conditions converges globally on smooth convex functions. This result was proved by Powell in 1976: we consider its implications for functions that are not smooth. In…
Gauss-Newton methods and their stochastic version have been widely used in machine learning and signal processing. Their nonsmooth counterparts, modified Gauss-Newton or prox-linear algorithms, can lead to contrasting outcomes when compared…
We present a hybrid algorithm between an evolution strategy and a quasi Newton method. The design is based on the Hessian Estimation Evolution Strategy, which iteratively estimates the inverse square root of the Hessian matrix of the…
The following document presents a possible solution and a brief stability analysis for a nonlinear system, which is obtained by studying the possibility of building a hybrid solar receiver; It is necessary to mention that the solution of…
We propose a definition of Jacobi quasi-Nijenhuis algebroid and show that any such Jacobi algebroid has an associated quasi-Jacobi bialgebroid. Therefore, also an associated Courant-Jacobi algebroid is obtained. We introduce the notions of…
In Part I of this work, we have proposed a general framework of decentralized stochastic quasi-Newton methods, which converge linearly to the optimal solution under the assumption that the local Hessian inverse approximations have bounded…
Newton's method has been an important approach for solving variational inequalities, quasi-Newton method is a good alternative choice to save computational cost. In this paper, we propose a new method for solving monotone variational…
This paper present a numerical method for solving nonlinear Fredholm integral equations. The method is based upon Newton type approximations. Illustrative examples are included to demonstrate the validity and applicability of the technique.
Classical theory for quasi-Newton schemes has focused on smooth deterministic unconstrained optimization while recent forays into stochastic convex optimization have largely resided in smooth, unconstrained, and strongly convex regimes.…
A variational approach is used to develop a robust numerical procedure for solving the nonlinear Poisson-Boltzmann equation. Following Maggs et al., we construct an appropriate constrained free energy functional, such that its…
Though quasi-Newton methods have been extensively studied in the literature, they either suffer from local convergence or use a series of line searches for global convergence which is not acceptable in the distributed setting. In this work,…
The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial…
We introduce a new non-degeneracy condition at infinity for a real or a mixed polynomial mapping $F$ which allows us to approximate its bifurcation locus in terms of certain Newton polyhedra. We derive a sufficiency result for the Jacobian…
We introduce the decentralized Broyden-Fletcher-Goldfarb-Shanno (D-BFGS) method as a variation of the BFGS quasi-Newton method for solving decentralized optimization problems. The D-BFGS method is of interest in problems that are not well…
A new continuous regularized Gauss-Newton-type method with simultaneous updates of the operator $(F^{\pr*}(x(t))F'(x(t))+\ep(t) I)^{-1}$ for solving nonlinear ill-posed equations in a Hilbert space is proposed. A convergence theorem is…