Skip to main content
SpringerLink
Log in

Approximate Newton Methods for Nonsmooth Equations

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

We develop general approximate Newton methods for solving Lipschitz continuous equations by replacing the iteration matrix with a consistently approximated Jacobian, thereby reducing the computation in the generalized Newton method. Locally superlinear convergence results are presented under moderate assumptions. To construct a consistently approximated Jacobian, we introduce two main methods: the classic difference approximation method and the ε-generalized Jacobian method. The former can be applied to problems with specific structures, while the latter is expected to work well for general problems. Numerical tests show that the two methods are efficient. Finally, a norm-reducing technique for the global convergence of the generalized Newton method is briefly discussed.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Robinson, S. M., Local Structure of Feasible Sets in Nonlinear Programming Part 3: Stability and Sensitivity, Mathematical Programming Study, Vol. 30, pp. 45–66, 1987.

    Google Scholar 

  2. Robinson, S. M., Newton's Method for a Class of Nonsmooth Functions, Working Paper, Industrial Engineering Department, University of Wisconsin, Madison, Wisconsin, 1988.

    Google Scholar 

  3. Robinson, S. M., An Implicit Function Theorem for B-Differentiable Functions, Working Paper, Industrial Engineering Department, University of Wisconsin, Madison, Wisconsin, 1988.

    Google Scholar 

  4. Harker, P. T., and Xiao, B., Newton's Method for Nonlinear Complementarity Problem: A B-Differentiable Equation Approach, Mathematical Programming, Vol. 48, pp. 339–357, 1990.

    Google Scholar 

  5. Pang, J. S., Newton's Method for B-Differentiable Equations, Mathematics of Operation Research, Vol. 15, pp. 311–341, 1990.

    Google Scholar 

  6. Pang, J. S., A B-Differentiable Equation-Based, Globally and Locally Quadratically Convergent Algorithm for Nonlinear Programs, Complementarity, and Variational Inequality Problems, Mathematical Programming, Vol. 51, pp. 101–131, 1991.

    Google Scholar 

  7. Qi, L., Superlinearly Convergent Approximate Newton Methods for LC1-Optimization Problems, Mathematical Programming, Vol. 64, pp. 277–294, 1994.

    Google Scholar 

  8. Sun, J., and Qi, L., An Interior Point Algorithm of O(\(\sqrt m \)|log ε|) Iterations for C 1-Convex Programming, Mathematical Programming, Vol. 57, pp. 239–257, 1992.

    Google Scholar 

  9. Xiao, B., and Harker, P. T., A Nonsmooth Newton Method for Variational Inequalities, Part 1: Theory, Mathematical Programming, Vol. 65, pp. 151–194, 1994.

    Google Scholar 

  10. Xiao, B., and Harker, P. T., A Nonsmooth Newton Method for Variational Inequalities, Part 2: Numerical Results, Mathematical Programming, Vol. 65, pp. 195–216, 1994.

    Google Scholar 

  11. Kojima, M., and Shindo, S., Extensions of Newton and Quasi-Newton Methods to Systems of PC1-Equations, Journal of the Operation Research Society of Japan, Vol. 29, pp. 352–374, 1986.

    Google Scholar 

  12. Ip, C. M., and Kyparisis, J., Local Convergence of Quasi-Newton Methods for B-Differentiable Equations, Mathematical Programming, Vol. 58, pp. 71–89, 1992.

    Google Scholar 

  13. Qi, L., and Sun, J., A Nonsmooth Version of Newton's Method, Mathematical Programming, Vol. 58, pp. 353–367, 1993.

    Google Scholar 

  14. Clarke, F. K., Optimization and Nonsmooth Analysis, John Wiley and Sons, New York, New York, 1983.

    Google Scholar 

  15. Pang, J. S., and Qi, L., Nonsmooth Equations: Motivation and Algorithms, SIAM Journal on Optimization, Vol. 3, pp. 443–465, 1993.

    Google Scholar 

  16. Qi, L., Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations, Mathematics of Operation Research, Vol. 18, pp. 227–244, 1993.

    Google Scholar 

  17. Chen, X., and Qi, L., A Parameterized Newton Method and a Quasi-Newton Method for Solving Nonsmooth Equations, Computational Optimization and Applications, Vol. 3, pp. 157–179, 1994.

    Google Scholar 

  18. Xu, H., A New Version of Newton's Method for Nonsmooth Equations, Numerical Report 158, Dundee University, Dundee, Scotland, 1995.

    Google Scholar 

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

    Google Scholar 

  20. Mayne, D. Q., and Polak, E., Nondifferentiable Optimization Adaptive Smoothing, Journal of Optimization Theory and Applications, Vol. 43, pp. 601–613, 1984.

    Google Scholar 

  21. Martinez, J. M., and Qi, L., Inexact Newton Methods for Solving Nonsmooth Equations, Journal of Computational and Applied Mathematics Vol. 60, pp. 127–145, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Ningbo University, Ningbo, Zhejiang Province, P.R.China

    H. Xu & X. W. Chang

  2. Department of Mathematics and Computer Sciences, University of Dundee, Dundee, Scotland

    H. Xu

Authors
  1. H. Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. X. W. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, H., Chang, X.W. Approximate Newton Methods for Nonsmooth Equations. Journal of Optimization Theory and Applications 93, 373–394 (1997). https://doi.org/10.1023/A:1022606224224

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022606224224

Search

Navigation