We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show that the resulting proximal Newton-type methods inherit the desirable convergence behavior of Newton-type methods for minimizing smooth functions, even when search directions are computed inexactly. Many pop...

This paper investigates the global chaos synchronization of identical hyperchaotic Newton-Leipnik systems (Ghosh and Bhattacharya, 2010) by sliding mode control. The stability results derived in this paper for the complete synchronization of identical hyperchaotic Newton-Leipnik chaotic systems are established using Lyapunov stability theory. Since the Lyapunov exponents are not required for th...

The q-generalizations of the two fundamental statements of matrix algebra – the Cayley-Hamilton theorem and the Newton relations – to the cases of quantum matrix algebras of an ”RTT-” and of a ”Reflection equation” types have been obtained in [2]–[6]. We construct a family of matrix identities which we call Cayley-HamiltonNewton identities and which underlie the characteristic identity as well ...

In this paper we show some properties of the Newton polygon of a polynomial ordinary differential equation. We give the relation between the Newton polygons of a differential polynomial and its partial derivatives. Newton polygons of evaluations of differential polynomials are also described.

The Newton radius of a code is the largest weight of a uniquely correctable error. We establish a lower bound for the Newton radius in terms of the rate. In particular we show that in any family of linear codes of rate below one half, the Newton radius increases linearly with the codeword length.

The most important line-search algorithms for solving large-scale unconstrained optimization problems we consider in this paper are the quasi-Newton methods, truncated Newton and conjugate gradient. These methods proved to be efficient, robust and relatively inexpensive in term of computation. In this paper we compare the Dolan-Moré [11] performance profile of line-search algorithms implemented...

We propose a fully distributed Newton-type algorithm for state estimation of electric power systems. At each Newton iteration, matrix-splitting techniques are utilized to carry out the matrix inversion for calculating the Newton step in a distributed fashion. In order to reduce the communication burden as well as increase robustness of state estimation, the proposed distributed scheme relies on...

This paper proposes a new Newton-like method which defines new iterates using a linear system with the same coefficient matrix in each iterate, while the correction is performed on the right-hand-side vector of the Newton system. In this way a method is obtained which is less costly than the Newton method and faster than the fixed Newton method. Local convergence is proved for nonsingular syste...

We derive Newton-type solution algorithms for a Bernoulli-type freeboundary problem at the continuous level. The Newton schemes are obtained by applying Hadamard shape derivatives to a suitable weak formulation of the freeboundary problem. At each Newton iteration, an updated free boundary position is obtained by solving a boundary-value problem at the current approximate domain. Since the boun...