We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Skip to main content
Log in

Remarks on the generalized Newton method

  • Published:
Mathematical Programming Submit manuscript

Abstract

We give some convergence results for the generalized Newton method for the computation of zeros of nondifferentiable functions which we proposed in an earlier work. Our results show that the generalized method can converge quadratically when used to compute the zeros of the sum of a differentiable function and the (multivalued) subgradient of a lower semicontinuous proper convex function. The method is therefore effective for variational inequalities and can be used to find the minimum of a function which is the sum of a twice-differentiable convex function and a lower semicontinuous proper convex function. A numerical example is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. C. Baiocchi, “Disequazioni variazionali,”Bolletino dell' Unione Matematica Italiana 18-A (1981) 173–187.

    Google Scholar 

  2. C. Baiocchi and A. Capelo,Disequazioni Variazionali e Quasivariazionali: Applicazioni a Problemi di Frontiera Libera (Edizione Pitagora, Bologna, 1978).

    Google Scholar 

  3. V. Barbu,Nonlinear Semigroups and Differential Equations in Banach Spaces (Editura Academei, 1980).

  4. D.P. Bertsekas and J.N. Tsitsiklis,Parallel and Distributed Computation (Prentice-Hall, Englewood Cliffs, NJ, 1989).

    Google Scholar 

  5. I. Ekeland and R. Temam,Convex Analysis and Variational Problems (North-Holland, Amsterdam, 1976).

    Google Scholar 

  6. D. Gabay, “Applications of the method of multipliers to variational inequalities,” in: M. Fortin and R. Glowinski, eds.,Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-value Problems (North-Holland, Amsterdam, 1983) pp. 299–331.

    Google Scholar 

  7. D. Gabay and B. Mercier, “A dual algorithm for the solution of nonlinear variational problems via finite element approximations,”Computers and Mathematics with Applications 2 (1976) 17–40.

    Google Scholar 

  8. R. Glowinski,Numerical Methods for Nonlinear Variational Problems (Springer, Berlin, 1984).

    Google Scholar 

  9. R. Glowinski, J.L. Lions and R. Tremolières,Numerical Analysis of Variational Inequalities (North-Holland, Amsterdam, 1981).

    Google Scholar 

  10. L.V. Kantorovich and G.P. Akilov,Functional Analysis (Pergamon Press, Oxford, 1982).

    Google Scholar 

  11. P.L. Lions and B. Mercier, “Splitting algorithms for the sum of two nonlinear operators,”SIAM Journal on Numerical Analysis 16 (1979) 964–979.

    Google Scholar 

  12. J.M. Ortega and W.C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970).

    Google Scholar 

  13. A.M. Ostrowski,Solution of Equations in Euclidean and Banach Spaces (Academic Press, New York, 1973).

    Google Scholar 

  14. R. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).

    Google Scholar 

  15. L.U. Uko, “The solution of finite dimensional variational inequalities using systematic relaxation,”Journal of the Nigerian Mathematical Society 8 (1989) 61–75.

    Google Scholar 

  16. L.U. Uko, “The location of zeros using generalizations of Newton's method,” Internal Report IC/90/34, International Centre for Theoretical Physics (Trieste, 1990).

    Google Scholar 

  17. M.M. Vainberg,Variational Method and Method of Monotone Operators in the Theory of Nonlinear Equations (Halsted Press, New York, 1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Uko, L.U. Remarks on the generalized Newton method. Mathematical Programming 59, 405–412 (1993). https://doi.org/10.1007/BF01581255

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581255

Key words

Navigation