Skip to main content
SpringerLink
Log in

A Survey of Some Nonsmooth Equations and Smoothing Newton Methods

  • Chapter
Progress in Optimization

Part of the book series: Applied Optimization ((APOP,volume 30))

Abstract

In this article we review and summarize recent developments on nonsmooth equations and smoothing Newton methods. Several new suggestions are presented.

This work is supported by the Australian Research Council.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.C. Billups, Algorithms for complementarity problems and generalized equations. Ph.D thesis, Department of Computer Sciences, University of Wisconsin-Madison, USA, 1995.

    Google Scholar 

  2. S.C. Billups and M.C. Ferris, QPCOMP: a quadratic programming based solver for mixed complementarity problems. Mathematical Programming, 76, 1997, 533–562.

    MathSciNet  MATH  Google Scholar 

  3. J. Burke and S. Xu, A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem. Preprint, Department of Mathematics, University of Washington, Seattle, WA 98195, September 1997.

    Google Scholar 

  4. J. Burke and S. Xu, A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques. To appear in Mathematical Programming.

    Google Scholar 

  5. J. Burke and S. Xu, The global linear convergence of a non-interior path- following algorithm for linear complementarity problem. To appear in Mathematics of Operations Research.

    Google Scholar 

  6. J. Burke and S. Xu, A non-interior predictor-corrector path following method for LCP. In Reformulation - Nonsmooth, Piecewise Smooth, Semis- mooth and Smoothing Methods, M. Fukushima and L. Qi, eds., Kluwer Academic Publisher, Nowell, Maryland, 1998, 45–64.

    Google Scholar 

  7. B. Chen and X. Chen, A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints. Preprint, Department of Management and Systems, Washington State University, Pullman, March 1997.

    Google Scholar 

  8. B. Chen and X. Chen, A global and local superlinear continuation- smoothing method for P0 + R0 and monotone NCP. To appear in SIAM Journal on Optimization.

    Google Scholar 

  9. B. Chen, X. Chen and C. Kanzow, A penalized Fischer-Burmeister NCP- function: theoretical investigation and numerical results. Applied Mathematics Report 97/28, School of Mathematics, The University of New South Wales, Sydney 2052, Australia, September 1997.

    Google Scholar 

  10. B. Chen and P.T. Harker, A non-interior-point continuation method for linear complementarity problems. SIAM Journal on Matrix Analysis and Applications, 14, 1993, 1168–1190.

    Article  MathSciNet  MATH  Google Scholar 

  11. B. Chen and P.T. Harker, A continuation method for monotone variational inequalities. Mathematical Programming, 69, 1995, 237–253.

    Article  MathSciNet  MATH  Google Scholar 

  12. B. Chen and P.T. Harker, Smooth approximations to nonlinear complementarity problems. SIAM Journal on Optimization, 7, 1997, 403–420.

    Article  MathSciNet  MATH  Google Scholar 

  13. B. Chen and N. Xiu, A global linear and local quadratic non-interior continuation method for nonlinear complementarity problems based on Chen- Mangasarian smoothing function. To appear in SIAM Journal on Optimization.

    Google Scholar 

  14. C. Chen and O.L. Mangasarian, Smoothing methods for convex inequalities and linear complementarity problems. Mathematical Programming, 71, 1995, 51–69.

    Article  MathSciNet  MATH  Google Scholar 

  15. C. Chen and O.L. Mangasarian, A class of smoothing functions for nonlinear and mixed complementarity problems. Computational Optimization and Applications, 5, 1996, 97–138.

    Article  MathSciNet  MATH  Google Scholar 

  16. X. Chen, L. Qi and D. Sun, Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities. Mathematics of Computation, 67, 1998, 519–540.

    Article  MathSciNet  MATH  Google Scholar 

  17. X. Chen and Y. Ye, On homotopy-smoothing methods for variational inequalities. To appear in SIAM Journal on Control and Optimization.

    Google Scholar 

  18. F.H. Clarke, Optimization and Nonsmooth Analysis. Wiley, New York, 1983.

    MATH  Google Scholar 

  19. T. De Luca, F. Facchinei and C. Kanzow, A semismooth equation approach to the solution of nonlinear complementarity problems. Mathematical Programming, 75, 1996, 407–439.

    Article  MathSciNet  MATH  Google Scholar 

  20. T. De Luca, F. Facchinei and C. Kanzow, A theoretical and numerical comparison of some semismooth algorithms for complementarity problems. Mathematical Programming Technical Report 97–15, Computer Sciences Department, University of Wisconsin-Madison, Madison, WI, December 1997.

    Google Scholar 

  21. J.E. Dennis, Jr. and J. J. Moré, Quasi-Newton methods: Motivation and theory. SIAM Review, 19, 1977, 46–89.

    MathSciNet  MATH  Google Scholar 

  22. J.E. Dennis, Jr. and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs, New Jersey, 1983.

    Google Scholar 

  23. S.P. Dirkse and M.C. Ferris, The PATH solver: A non-monotone stabilization scheme for mixed complementarity problems. Optimization Methods and Software, 5, 1995, 123–156

    Article  Google Scholar 

  24. S.P. Dirkse and M.C. Ferris, MCPLIB: A collection of nonlinear mixed complementarity problems. Optimization Methods and Software, 5, 1995, 319–345.

    Article  Google Scholar 

  25. S.P. Dirkse, M.C. Ferris, P.V. Preckel, and T. Rutherford, The GAMS callable program library for variational and complementarity solvers. Mathematical Programming Technical Report 94-07, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 1994.

    Google Scholar 

  26. B.C. Eaves, On the basic theorem of complementarity. Mathematical Programming, 1, 1971, 68–75.

    Article  MathSciNet  MATH  Google Scholar 

  27. F. Facchinei, A. Fischer and C. Kanzow, Inexact Newton methods for semismooth equations with applications to variational inequality problems. In Nonlinear Optimization and Applications, G. Di Pillo and F. Giannessi, eds., Plenum Press, New York, 1996, 125 - 139.

    Google Scholar 

  28. F. Facchinei, A. Fischer and C. Kanzow, A semismooth Newton method for variational inequalities: The case of box constraints. In Complementarity and Variational Problems: State of the Art, M.C. Ferris and J.S. Pang, eds., SIAM, Philadelphia, Pennsylvania, 1997, 76–90.

    Google Scholar 

  29. F. Facchinei, A. Fischer and C. Kanzow, Regularity properties of a semismooth equation reformulation of variational inequalities. SIAM Journal on Optimization, 8, 1998, 850–869.

    Article  MathSciNet  MATH  Google Scholar 

  30. F. Facchinei, H. Jiang, and L. Qi, A smoothing method for mathematical programming with equilibrium constraints. To appear in Mathematical Programming.

    Google Scholar 

  31. F. Facchinei and C. Kanzow, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. Mathematical Programming, 76, 1997, 493–512.

    MathSciNet  MATH  Google Scholar 

  32. F. Facchinei and C. Kanzow, Beyond monotonicity in regularization methods for nonlinear complementarity problems. To appear in SIAM Journal on Control and Optimization.

    Google Scholar 

  33. F. Facchinei and J. Soares, A new merit function for nonlinear complementarity problems and a related algorithm. SIAM Journal on Optimization, 7, 1997, 225–247.

    Article  MathSciNet  MATH  Google Scholar 

  34. M. C. Ferris and T. F. Rutherford, Accessing realistic mixed complementarity problems within MATLAB. In Nonlinear Optimization and Applications, G. Di Pillo and F. Giannessi, eds., Plenum Press, New York, 1996, 141–153.

    Google Scholar 

  35. A. Fischer, A special Newton-type optimization method. Optimization, 24, 1992, 269–284.

    Article  MathSciNet  MATH  Google Scholar 

  36. A. Fischer, An NCP-function and its use for the solution of complementarity problems, in Recent Advances in Nonsmooth Optimization, D. Du, L, Qi and R. Womersley, eds., World Scientific Publishers, New Jersy, 1995, 88–105.

    Chapter  Google Scholar 

  37. A. Fischer, Solution of monotone complementarity problems with locally Lipschitzian functions. Mathematical Programming, 76, 1997, 513–532.

    MathSciNet  MATH  Google Scholar 

  38. M. Fukushima, Merit functions for variational inequality and complementarity problems. In Nonlinear Optimization and Applications, G. Di Pillo and F. Giannessi, eds., Plenum Publishing Corporation, New York, 1996, 155–170.

    Google Scholar 

  39. M. Fukushima, Z.-Q. Luo, and J.-S. Pang, A globally convergent sequential quadratic programming algorithm for mathematical programming problems with linear complementarity constraints. Computational Optimization and Applications, 10, 1998, 5–34.

    Article  MathSciNet  MATH  Google Scholar 

  40. S.A. Gabriel and J.J. More, Smoothing of mixed complementarity problems. In Complementarity and Variational Problems: State of the Art, M.C. Ferris and J.S. Pang, eds., SIAM, Philadelphia, Pennsylvania, 1997, 105–116.

    Google Scholar 

  41. C. Geiger and C. Kanzow, On the resolution of monotone complementarity problems. Computational Optimization and Applications, 5, 1996, 155–173.

    Article  MathSciNet  MATH  Google Scholar 

  42. M.S. Gowda and M.A. Tawhid, Existence and limiting behavior of associated with P0-equations. To appear in Computational Optimization and Applications.

    Google Scholar 

  43. P.T. Harker and J.-S. Pang, Finite-dimensional variational inequality and nonlinear complementarity problem: A survey of theory, algorithms and applications. Mathematical Programming, 48, 1990, 161–220.

    Article  MathSciNet  MATH  Google Scholar 

  44. P.T. Harker and B. Xiao, Newton method for the nonlinear complementarity problem: A B-differentiable equation approach. Mathematical Programming, 48, 1990, 339–357.

    Article  MathSciNet  MATH  Google Scholar 

  45. K. Hotta and A. Yoshise, Global convergence of a class of non-interior- point algorithms using Chen-Harker-Kanzow functions for nonlinear complementarity problems. Discussion Paper Series No. 708, Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba, Ibaraki 305, Japan, December 1996.

    Google Scholar 

  46. H. Jiang, Unconstrained minimization approaches to nonlinear complementarity problems. Journal of Global Optimization, 9, 1996, 169–181.

    Article  MATH  Google Scholar 

  47. H. Jiang, Global convergence analysis of the generalized Newton and Gauss-Newton methods of the Fischer-Burmeister equation for the complementarity problem. To appear in Mathematics of Operations Research.

    Google Scholar 

  48. H. Jiang, Smoothed Fischer-Burmeister equation methods for the nonlinear complementarity problem. Preprint, Department of Mathematics & Statistics, The University of Melbourne, Victoria 3052, Australia, June 1997.

    Google Scholar 

  49. H. Jiang and L. Qi, A new nonsmooth equation approach to nonlinear complementarity problems. SIAM Journal on Control and Optimization, 35, 1997, 178–193.

    Article  MathSciNet  MATH  Google Scholar 

  50. H. Jiang, L. Qi, X. Chen and D. Sun, Semismoothness and superlinear convergence in nonsmooth optimization and nonsmooth equations. In Nonlinear Optimization and Applications, G. Di Pillo and F. Giannessi, eds., Plenum Publishing Corporation, New York, 1996, 197–212.

    Google Scholar 

  51. H. Jiang and D. Ralph, Smooth SQP methods for mathematical programs with nonlinear complementarity constraints. Manuscript, Department of Mathematics & Statistics, The University of Melbourne, December 1997.

    Google Scholar 

  52. H. Jiang and D. Ralph, Global and local superlinear convergence analysis of Newton-type methods for semismooth equations with smooth least squares. In Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, M. Fukushima and L. Qi, eds. Kluwer Academic Publisher, Nowell, Maryland, 1998, 181–210.

    Google Scholar 

  53. N.H. Josephy, Newton’s method for generalized equations. Technical Report 1965, Mathematics Research Center, University of Wisconsin, Madison, 1979.

    Google Scholar 

  54. N.H. Josephy, Quasi-Newton methods for generalized equations. Technical Report 1966, Mathematics Research Center, University of Wisconsin, Madison, 1979.

    Google Scholar 

  55. C. Kanzow, An unconstrained optimization technique for large-scale linearly constrained convex minimization problems. Computing, 53, 1994, 101–117.

    Article  MathSciNet  MATH  Google Scholar 

  56. C. Kanzow, Some equation-based methods for the nonlinear complementarity problem. Optimization Methods and Software, 3, 1994, 327–340.

    Article  Google Scholar 

  57. C. Kanzow, Some noninterior continuation methods for linear complementarity problems. SIAM Journal on Matrix Analysis and Applications, 17, 1996, 851–868.

    Article  MathSciNet  MATH  Google Scholar 

  58. C. Kanzow and H. Jiang, A continuation method for (strongly) monotone variational inequalities. Mathematical Programming, 81, 1998, 140–157.

    MathSciNet  Google Scholar 

  59. C. Kanzow and H. Kleinmichel, A new class of semismooth Newton-type methods for nonlinear complementarity problems. To appear in Computational Optimization and Applications.

    Google Scholar 

  60. C. Kanzow and H. Pieper, Jacobian smoothing methods for general complementarity problems. To appear in SIAM Journal on Optimization.

    Google Scholar 

  61. C. Kanzow and H.-D. Qi, A QP-free constrained Newton-type method for variational inequality problems. To appear in Mathematical Programming.

    Google Scholar 

  62. M. Kojima and S. Shindo, Extensions of Newton and quasi-Newton methods to systems of PC1 equations. Journal of Operations Research Society of Japan, 29, 1986, 352–374.

    MathSciNet  MATH  Google Scholar 

  63. B. Kummer, Newton’s method for non-differentiable functions, in Advances in Mathematical Optimization, J. Guddat, B. Bank, H. Hollatz, P. Kail, D. Klatte, B. Kummer, K. Lommatzsch, L. Tammer, M. Vlach and K. Zimmerman, eds., Akademi-Verlag, Berlin, pp. 114–125, 1988.

    Google Scholar 

  64. B. Kummer, Newton’s method based on generalized derivatives for nonsmooth functions: Convergence analysis, in: W. Oettli and D. Pallaschke, eds., “Advances in Optimization”, Springer-Verlag, Berlin, 1992, 171–194.

    Google Scholar 

  65. O.L. Mangasarian, Unconstrained Lagrangians in nonlinear programming. SIAM Journal of Control, 13, 1975, 772–791.

    Article  MathSciNet  MATH  Google Scholar 

  66. O.L. Mangasarian, Unconstrained methods in nonlinear programming, in; Nonlinear Programming, SIAM-AMS Proceedings, Volume IX, American Math. Soc., Providence, Rhode Island, 169–184.

    Google Scholar 

  67. J.M. Martinez and L. Qi, Inexact Newton methods for solving nonsmooth equations. Journal of Computational and Applied Mathematics, 1995, 127–145.

    Google Scholar 

  68. R. Mifflin, Semismooth and semiconvex functions in constrained optimization. SIAM Journal on Control and Optimization, 15, 1977, 957–972.

    Article  MathSciNet  Google Scholar 

  69. J.J. Moré, Coercivity conditions in nonlinear complementarity problems. SIAM Review, 16, 1974, 1–16.

    Article  MathSciNet  MATH  Google Scholar 

  70. J.J. Moré, Global methods for nonlinear complementarity problems. Mathematics of Operations Research, 21, 1996, 589–614.

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  72. J.V. Outrata and J. Zowe, A Newton method for a class of quasi-variational inequalities. Computational Optimization and Applications, 4, 1995, 5–21.

    Article  MathSciNet  MATH  Google Scholar 

  73. J.-S. Pang, Newton’s method for B-differentiable equations. Mathematics of Operations Research, 15, 1990, 311–341.

    Article  MathSciNet  MATH  Google Scholar 

  74. J.S. Pang, A B-differentiable equation based, globally, and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems. Mathematical Programming, 51, 1991, 101–131.

    Article  MathSciNet  MATH  Google Scholar 

  75. J.S. Pang and D. Chan, Iterative methods for variational and complementarity problems. Mathematical Programming, 24, 1982, 284–313.

    Article  MathSciNet  MATH  Google Scholar 

  76. J.S. Pang and S.A. Gabriel, NE/SQP: A robust algorithm for the nonlinear complementarity problem. Mathematical Programming, 60, 1993, 295–337.

    Article  MathSciNet  MATH  Google Scholar 

  77. J.-S. Pang and L. Qi, Nonsmooth equations: Motivation and algorithms. SIAM Journal on Optimization, 3, 1993, 443–465.

    Article  MathSciNet  MATH  Google Scholar 

  78. J. Peng and Z. Lin, A non-interior continuation method for generalized linear complementarity problems. Preprint, Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, August 1997.

    Google Scholar 

  79. E. Polak, Optimization: Algorithms and Consistent Approximations. Springer, New York, 1997.

    MATH  Google Scholar 

  80. H.-D. Qi, A regularized smoothing Newton method for box constrained variational inequality problems with P0 functions. Preprint, Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, August 1997. Revised March 1998.

    Google Scholar 

  81. H.-D. Qi and L.Z. Liao, A smoothing Newton method for extended vertical linear complementarity problems. To appear in SIAM Journal on Matrix Analysis and Applications.

    Google Scholar 

  82. H.-D. Qi and L.Z. Liao, A smoothing Newton method for general nonlinear complementarity problems. Preprint, Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, March 1998.

    Google Scholar 

  83. L. Qi, Convergence analysis of some algorithms for solving nonsmooth equations. Mathematics of Operations Research, 18, 1993, 227–244.

    Article  MathSciNet  MATH  Google Scholar 

  84. L. Qi, Trust region algorithms for solving nonsmooth equations. SIAM Journal on Optimization, 5, 1995, 219–230.

    Article  MathSciNet  MATH  Google Scholar 

  85. L. Qi, C-differentiability, C-Differential operators and generalized Newton methods. AMR 96/5, Applied Mathematics Report, The University of New South Wales, Sydney 2052, 1996.

    Google Scholar 

  86. L. Qi, Regular pseudo-smooth NCP and BVIP functions and globally and quadratically convergent generalized Newton methods for complementarity and variational inequality problems. To appear in Mathematics of Operations Research.

    Google Scholar 

  87. L. Qi and X. Chen, A globally convergent successive approximation method for severely nonsmooth equations. SIAM Journal on Control and Optimization, 33, 1995, 402–418.

    Article  MathSciNet  MATH  Google Scholar 

  88. L. Qi and H. Jiang, Semismooth Karush-Kuhn-Tucker equations and convergence analysis of Newton and quasi-Newton methods for solving these equations. Mathematics of Operations Research, 22, 1997, 301–325.

    Article  MathSciNet  MATH  Google Scholar 

  89. L. Qi and D. Sun, Improving the convergence of non-interior point algorithms for nonlinear complementarity problems. To appear in Mathematics of Computation.

    Google Scholar 

  90. L. Qi, D. Sun and G. Zhou, A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. AMR 97/13, Applied Mathematics Report, School of Mathematics, The University of New South Wales, Sydney 2052, Australia, June 1997. Revised August 1998.

    Google Scholar 

  91. L. Qi and J. Sun, A nonsmooth version of Newton’s method. Mathematical Programming, 58, 1993, 353–367.

    Article  MathSciNet  MATH  Google Scholar 

  92. D. Ralph, Global convergence of damped Newton’s method for nonsmooth equations, via the path search. Mathematics of Operations Research, 19, 1994, 352–389.

    Article  MathSciNet  MATH  Google Scholar 

  93. G. Ravindran and M.S. Gowda, Regularization of P0-functions in box variational inequality problems. To appear in SIAM Journal on Optimization.

    Google Scholar 

  94. S.M. Robinson, Strongly regular generalized equations. Mathematics of Operations Research, 5, (1980), 43–62.

    Article  MathSciNet  MATH  Google Scholar 

  95. S.M. Robinson, Generalized equations and their solutions, part II: Applications to nonlinear programming. Mathematical Programming Study, 19, 1982, 200–221.

    MATH  Google Scholar 

  96. S.M. Robinson, Generalized equations, in Mathematical Programming: The State of the Art, A. Bachem, M. Grotschel and B. Korte, eds., Springer- Verlag, Berlin, 1983, 346–347.

    Google Scholar 

  97. S.M. Robinson, An implicit-function theorem for a class of nonsmooth equations. Mathematics of Operations Research, 16, 1991, 292–309.

    Article  MathSciNet  MATH  Google Scholar 

  98. S. M. Robinson, Normal maps induced by linear transformation. Mathematics of Operations Research, 17, 1992, 691–714.

    Article  MathSciNet  MATH  Google Scholar 

  99. S.M. Robinson, Newton’s method for a class of nonsmooth functions. Set- Valued Analysis, 2, 1994, 291–305.

    Article  MathSciNet  MATH  Google Scholar 

  100. A. Shapiro, On concepts of directional differentiability. Journal of Optimization Theory and Applications, 66, 1990, 477–487.

    Article  MathSciNet  MATH  Google Scholar 

  101. S. Smale, Algorithms for solving equations,, in Proceedings of the International Congress of Mathematicians, Berkeley, California, 172–195, 1986.

    Google Scholar 

  102. D. Sun, A regularization Newton method for solving nonlinear complementarity problems. To appear in Applied Mathematics and Optimization.

    Google Scholar 

  103. D. Sun and J. Han, Newton and quasi-Newton methods for a class of non- smooth equations and related problems. SIAM Journal on Optimization, 7, 1997, 463–480.

    Article  MathSciNet  MATH  Google Scholar 

  104. D. Sun and L. Qi, On NCP-functions. To appear in Computational Optimization and Applications.

    Google Scholar 

  105. D. Sun and R. S. Womersley, A new unconstrained differentiate merit function for box constrained variational inequality problems and a damped Gauss-Newton method. To appear in SIAM Journal on Optimization.

    Google Scholar 

  106. R. Sznajder and M.S. Gowda, On the limiting behavior of trajectory of regularized solutions of a P0-complementarity problem. Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, M. Fukushima and L. Qi, eds., Kluwer Academic Publisher, Nowell, Maryland, 1998, 371–380.

    Google Scholar 

  107. P. Tseng, Global behaviour of a class of merit functions for the nonlinear complementarity problem. Journal of Optimization Theory and Applications, 89, 1996, 17–37.

    Article  MathSciNet  MATH  Google Scholar 

  108. P. Tseng, Analysis of a non-interior continuation method based on Chen- Mangasarian functions for complementarity problems. In Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, M. Fukushima and L. Qi, eds., Kluwer Academic Publisher, Norwell, Maryland, 1998, 381–404.

    Google Scholar 

  109. S. Wright, Primal-Dual Interior Point Methods. SIAM, Philadelphia, PA, 1997.

    MATH  Google Scholar 

  110. B. Xiao and P.T. Harker, A nonsmooth Newton method for variational inequalities, I: Theory. Mathematical Programming, 65, 1994, 151–194.

    Article  MathSciNet  MATH  Google Scholar 

  111. B. Xiao and P.T. Harker, A nonsmooth Newton method for variational inequalities, II: Numerical results. Mathematical Programming, 65, 1994, 195–216.

    Article  MathSciNet  MATH  Google Scholar 

  112. N. Yamashita and M. Fukushima, Modified Newton methods for solving semismooth reformulations of monotone complementarity problems. Mathematical Programming, 76, 1997, 469–491.

    MathSciNet  MATH  Google Scholar 

  113. S. Xu, The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P- functions. Preprint, Department of Mathematics, University of Washington, Seattle, WA 98195, December 1996.

    Google Scholar 

  114. S. Xu, The global linear convergence and complexity of a non-interior path-following algorithm for monotone LCP based on Chen-Harker- Kanzow-Smale smooth functions. Preprint, Department of Mathematics, University of Washington, Seattle, WA 98195, February 1997.

    Google Scholar 

  115. G. Zhou, D. Sun and L. Qi, Numerical experiments for a class of squared smoothing Newton methods for complementarity and variational inequality problems. To appear in Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, M. Fukushima and L. Qi, eds., Kluwer Academic Publisher, Nowell, Maryland, 1998, 421 –441.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, The University of New South Wales, Sydney, NSW, 2052, Australia

    L. Qi & D. Sun

Authors
  1. L. Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Kluwer Academic Publishers

About this chapter

Cite this chapter

Qi, L., Sun, D. (1999). A Survey of Some Nonsmooth Equations and Smoothing Newton Methods. In: Progress in Optimization. Applied Optimization, vol 30. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3285-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3285-5_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3287-9

  • Online ISBN: 978-1-4613-3285-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation