Article Contents
Article Contents

# Partial Newton methods for a system of equations

• We define and analyse partial Newton iterations for the solutions of a system of algebraic equations. Firstly we focus on a linear system of equations which does not require a line search. To apply a partial Newton method to a system of nonlinear equations we need a line search to ensure that the linearized equations are valid approximations of the nonlinear equations. We also focus on the use of one or two components of the displacement vector to generate a convergent sequence. This approach is inspired by the Simplex Algorithm in Linear Programming. As expected the partial Newton iterations are found not to have the fast convergence properties of the full Newton method. But the proposed partial Newton iteration makes it significantly simpler and faster to compute in each iteration for a system of equations with many variables. This is because it uses only one or two variables instead of all the search variables in each iteration.
Mathematics Subject Classification: Primary: 49M15, 65K10; Secondary: 90C30, 90C52.

 Citation:

•  [1] B. S. Goh, Greatest descent algorithms in unconstrained optimization, J. Optim. Theory Appl., 142 (2009), 275-289.doi: 10.1007/s10957-009-9533-4. [2] B. S. Goh, Convergence of algorithms in optimization and solutions of nonlinear equations, J. Optim. Theory Appl., 144 (2010), 43-55.doi: 10.1007/s10957-009-9583-7. [3] C. T. Kelley, "Iterative Methods for Linear and Nonlinear Equations," SIAM Publication, Philadelphia, 1995.doi: 10.1137/1.9781611970944. [4] J. P. LaSalle, "The Stability of Dynamical Systems," SIAM Publication, Philadelphia, 1976.doi: 10.1137/1.9781611970432.