Related papers: A geometric Newton method for Oja's vector field

This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first…

In this paper, two numerical approaches based on the Newton iteration method with spectral algorithms are introduced to solve the Thomas-Fermi equation. That Thomas-Fermi equation is a nonlinear singular ordinary differential equation (ODE)…

The global minimum point of an optimization problem is of interest in engineering fields and it is difficult to be found, especially for a nonconvex large-scale optimization problem. In this article, we consider a new memetic algorithm for…

We consider the numerical solution of the continuous algebraic Riccati equation $A^*X+XA-XFX+G=0$, with $F=F^*, G=G^*$ of low rank and $A$ large and sparse. We develop an algorithm for the low rank approximation of $X$ by means of an…

A generalization of the Newton-based matrix splitting iteration method (GNMS) for solving the generalized absolute value equations (GAVEs) is proposed. Under mild conditions, the GNMS method converges to the unique solution of the GAVEs.…

We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…

This paper formulates an elementary algorithm for resolution of singularities in a neighborhood of a singular point over a field of characteristic zero. The algorithm is composed of finite sequences of Newton polyhedra and monomial…

The multiplicative Newton-like method developed by the author et al. is extended to the situation where the dynamics is restricted to the orthogonal group. A general framework is constructed without specifying the cost function. Though the…

Let $A$ be a $2\times 2$ matrix over a finite field and consider the Yang-Baxter matrix equation $XAX=AXA$ with respect to $A$. We use a method of computational ideal theory to explore the geometric structure of the affine variety of all…

The purpose of this paper is to show how the problem of finding the zeros of unilateral n-order quaternionic polynomials can be solved by determining the eigen-vectors of the corresponding companion matrix. This approach, probably…

In this paper, we modify the Newton-Secant method with third order of convergence for finding multiple roots of nonlinear equations. Per iteration this method requires two evaluations of the function and one evaluation of its first…

Existing structural analysis methods may fail to find all hidden constraints for a system of differential-algebraic equations with parameters if the system is structurally unamenable for certain values of the parameters. In this paper, for…

The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the…

We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method…

We proposed in this paper a new method, which we named the W4 method, to solve nonlinear equation systems. It may be regarded as an extension of the Newton-Raphson~(NR) method to be used when the method fails. Indeed our method can be…

We propose a Forward-Backward Truncated-Newton method (FBTN) for minimizing the sum of two convex functions, one of which smooth. Unlike other proximal Newton methods, our approach does not involve the employment of variable metrics, but is…

In this paper, we propose a new method that combines the inexact Newton method with a procedure to obtain a feasible inexact projection for solving constrained smooth and nonsmooth equations. The local convergence theorems are established…

In this paper, we propose objective-function-free (OFF) variants of the proximal Newton method for nonconvex composite optimization problems and the regularized Newton method for unconstrained optimization problems, respectively, using…

In this paper we consider the Newton's method for solving the generalized equation of the form $ f(x) +F(x) \ni 0, $ where $f:{\Omega}\to Y$ is a continuously differentiable mapping, $X$ and $Y$ are Banach spaces, $\Omega\subseteq X$ an…

We present a new method for solving symbolically zero--dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures: arithmetic networks and…