On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis
نویسنده
چکیده
Newton iteration is known (under some precise conditions) to converge quadratically to zeros of non-degenerate systems of polynomials. This and other properties may be used to obtain theorems on the global complexity of solving systems of polynomial equations (See Shub and Smale in [6]), using a model of computability over the reals. However, it is not practical (and not desirable) to actually compute Newton iteration exactly. In this paper, approximate Newton iteration is investigated for several generalizations of the Newton operator. Quadratic covergence theorems and a robustness theorem are extended to approximate Newton iteration, generalizing some of the results in [6]. The results here can be used to prove complexity theorems on path following algorithms for solving systems of polynomial equations, using a model of computation over the integers (Malajovich [3])
منابع مشابه
On Generalized Newton Algorithms : Quadratic Convergence , Path - Followingand Error
Newton iteration is known (under some precise conditions) to converge quadratically to zeros of non-degenerate systems of polynomials. This and other properties may be used to obtain theorems on the global complexity of solving systems of polynomial equations (See Shub and Smale in 6]), using a model of computability over the reals. However, it is not practical (and not desirable) to actually c...
متن کاملConvergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems
In this paper, the Iri-Imai algorithm for solving linear and convex quadratic programming is extended to solve some other smooth convex programming problems. The globally linear convergence rate of this extended algorithm is proved, under the condition that the objective and constraint functions satisfy a certain type of convexity (called the harmonic convexity in this paper). A characterizatio...
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملOptimization Methods in Banach Spaces
In this chapter we present a selection of important algorithms for optimization problems with partial differential equations. The development and analysis of these methods is carried out in a Banach space setting. We begin by introducing a general framework for achieving global convergence. Then, several variants of generalized Newton methods are derived and analyzed. In particular, necessary a...
متن کاملError Bounds and Superlinear Convergence Analysis of Some Newton-type Methods in Optimization
We show that, for some Newton-type methods such as primal-dual interior-point path following methods and Chen-Mangasarian smoothing methods, local superlinear convergence can be shown without assuming the solutions are isolated. The analysis is based on local error bounds on the distance from the iterates to the solution set.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 133 شماره
صفحات -
تاریخ انتشار 1994