Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems

SIAM Journal on Optimization

Volumn 11, Issue 4, 2001, Pages 889-917

  Ulbrich, Michael ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Global convergence; Nonlinear mixed complementarity problem; Nonmonotone trust region method; Nonsmooth Newton method; Semismooth equation; Superlinear and quadratic convergence

Indexed keywords

EID: 0035643190     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623499356344     Document Type: Article

References (52)

1. S. C. BILLUPS, Algorithms for Complementarity Problems and Generalized Equations, Ph.D. thesis, Computer Sciences Department, University of Wisconsin, Madison, WI, 1995.
2. S. C. BILLUPS, S. P. DIRKSE, AND M. C. FERRIS, A comparison of large scale mixed complementarity problem solvers, Comput. Optim. Appl., 7 (1997), pp. 3-25.
3. S. C. BILLUPS AND M. C. FERRIS, QPCOMP: A quadratic program based solver for mixed complementarity problems, Math. Programming, 76 (1997), pp. 533-562.
4. J. V. BURKE. J. J. MORÉ, AND G. TORALDO, Convergence properties of trust region methods for linear and convex constraints, Math. Programming, 47 (1990), pp. 305-336.
5. B. CHEN, X. CHEN, AND C. KANZOW, A Penalized Fischer-Burmeister NCP-Function: Theoretical Investigation and Numerical Results, Preprint 126, Institute of Applied Mathematics, University of Hamburg, Hamburg, Germany, 1997.
6. F. H. CLARKE, Optimization and Nonsmooth Analysis, John Wiley, New York, 1983.
7. T. F. COLEMAN AND Y. LI, An interior trust region approach for nonlinear minimization subject to bounds, SIAM J. Optim., 6 (1996), pp. 418-445.
8. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM J. Numer. Anal., 25 (1988), pp. 433-460. See [9].
9. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Correction to the paper on global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM J. Numer. Anal., 26 (1989), pp. 764-767.
10. T. DE LUCA, F. FACCHINEI, AND C. KANZOW, A semismooth equation approach to the solution of nonlinear complementarity problems, Math. Programming, 75 (1996), pp. 407-439.
11. S. P. DIRKSE AND M. C. FERRIS, The PATH solver: A non-monotone stabilization scheme for mixed comple-mentarity problems, Optim. Methods Softw., 5 (1995), pp. 123-156.
12. S. P. DIRKSE AND M. C. FERRIS, MCPLIB: A collection of nonlinear mixed complementarity problems, Optim. Methods Softw., 5 (1995), pp. 319-345.
13. F. FACCHINEI AND C. KANZOW, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems, Math. Programming, 76 (1997), pp. 493-512.
14. M. C. FERRIS AND C. KANZOW, Complementarity and Related Problems: A Survey, Mathematical Programming Technical Report 98-17, Computer Sciences Department, University of Wisconsin, Madison, WI, 1998.
15. M. C. FERRIS, C. KANZOW, AND T. S. MUNSON, Feasible descent algorithms for mixed complementarity problems, Math. Programming, 86 (1999), pp. 475-497.
16. M. C. FERRIS AND J.-S. PANG, Engineering and economic applications of complementarity problems, SIAM Rev., 39 (1997), pp. 669-713.
17. A. FISCHER, A special Newton-type optimization method, Optimization, 24 (1992), pp. 269-284.
18. A. FISCHER, Solution of monotone complementarity problems with locally Lipschitzian functions, Math. Programming, 76 (1997), pp. 513-532.
19. A. FRIEDLANDER, J. M. MARTÍNEZ, AND A. SANTOS, A new trust region algorithm for bound constrained minimization, Appl. Math. Optim., 30 (1994), pp. 235-266.
20. S. A. GABRIEL AND J.-S. PANG, A trust region method for constrained nonsmooth equations, in Large Scale Optimization: State of the Art, W. W. Hager, D. W. Hearn, and P. M. Pardalos, eds., Kluwer Academic Publishers, Boston, MA, 1994, pp. 159-186.
21. L. GRIPPO, F. LAMPARIELLO. AND S. LUCIDI, A nonmonotone line search technique for Newton's method, SIAM J. Numer. Anal., 23 (1986), pp. 707-716.
22. P. T. HARKER AND J.-S. PANG, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Math. Programming, 48 (1990), pp. 161-220.
23. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms. Part I: Fundamentals, Springer, Berlin, 1993.
24. H. JIANG, M. FUKUSHIMA, L. QI, AND D. SUN, A trust region method for solving generalized complementarity problems, SIAM J. Optim., 8 (1998), pp. 140-157.
25. H. JIANG AND L. QI. A new nonsmooth equations approach to nonlinear complementarity problems, SIAM J. Control Optim., 35 (1997), pp. 178-193.
26. 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 Publishers, Dordrecht, 1999, pp. 181-209.
27. C. KANZOW AND H.-D. QI, A QP-free constrained Newton-type method for variational inequality problems, Math. Programming, 85 (1999), pp. 81-106.
28. C. KANZOW AND M. ZUPKE, Inexact trust-region methods for nonlinear complementarity problems, in Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, M. Fukushima and L. Qi, eds., Kluwer Academic Publishers, Dordrecht, 1999, pp. 211-233.
29. B. KUMMER, Newton's method for non-differentiate functions, in Advances in Mathematical Optimization, J. Guddat et al., eds., Akademie-Verlag, Berlin, 1988, pp. 114-125.
30. B. KUMMER, Newton's method based on generalized derivatives for nonsmooth functions: Convergence analysis, in Advances in Mathematical Optimization, Lecture Notes in Econom. and Math. Systems 382, W. Oettli and D. Pallaschke, eds., Springer-Verlag, Heidelberg, 1992, pp. 171-194.
31. C.-J. LIN AND J. J. MORÉ, Newton's method for large bound-constrained optimization problems, SIAM J. Optim., 9 (1999), pp. 1100-1127.
32. J. LIU, Strong stability in variational inequalities, SIAM J. Control Optim., 33 (1995), pp. 725-749.
33. CS. MÉSZÁROS, The BPMPD Interior Point Solver for Convex Quadratic Problems, Working paper WP 98-8, Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary, 1998.
34. R. MIFFLIN, Semismooth and semiconvex functions in constrained optimization, SIAM J. Control Optim., 15 (1977), pp. 959-972.
35. J. J. MORÉ, Global methods for nonlinear complementarity problems, Math. Oper. Res., 21 (1996), pp. 589-614.
36. J.-S. PANG, Newton's method for B-differentiate equations, Math. Oper. Res., 15 (1990), pp. 311-341.
37. J.-S. PANG, A B-differentiable equation based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems, Math. Programming, 51 (1991), pp. 101-132.
38. J.-S. PANG AND S. A. GABRIEL, NE/SQP: A robust algorithm for the nonlinear complementarity problem, Math. Programming, 60 (1993), pp. 295-337.
39. J.-S. PANG AND L. QI, Nonsmooth equations: Motivation and algorithms, SIAM J. Optim., 3 (1993), pp. 443-465.
40. L. QI, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res., 18 (1993), pp. 227-244.
41. L. QI, Trust region algorithms for solving nonsmooth equations, SIAM J. Optim., 5 (1995), pp. 219-230.
42. L. QI, Regular pseudo-smooth NCP and BVIP functions and globally and quadratically convergent generalized Newton methods for complementarity and variational inequality problems, Math. Oper. Res., 24 (1999), pp. 440-471.
43. L. QI AND J. SUN, A nonsmooth version of Newton's method, Math. Programming, 58 (1993), pp. 353-367.
44. S. M. ROBINSON, Strongly regular generalized equations, Math. Oper. Res., 5 (1980), pp. 43-62.
45. S. M. ROBINSON, Newton's method for a class of nonsmooth functions, Set-Valued Anal., 2 (1994), pp. 291-305.
46. D. SUN AND L. QI, On NCP-functions, Comput. Optim. Appl., 13 (1999), pp. 201-220.
47. PH. L. TOINT, Global convergence of a class of trust-region methods for nonconvex minimization in Hubert space, IMA J. Numer. Anal., 8 (1988), pp. 231-252.
48. PH. L. TOINT, Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints, Math. Programming, 77 (1997), pp. 69-94.
49. M. ULBRICH, S. ULBRICH, AND M. HEINKENSCHLOSS, Global convergence of trust-region interior-point algorithms for infinite-dimensional nonconvex minimization subject to point-wise bounds, SIAM J. Control Optim., 37 (1999), pp. 731-764.
50. B. XIAO AND P. T. HARKER, A nonsmooth Newton method for variational inequalities: I: Theory, Math. Programming, 65 (1994), pp. 151-194.
51. B. XIAO AND P. T. HARKER, A nonsmooth Newton method for variational inequalities: II: Numerical results, Math. Programming, 65 (1994), pp. 195-216.
52. W. P. ZIEMER, Weakly Differentiable Functions. Sobolev Spaces and Functions of Bounded Variation, Springer-Verlag, Berlin, 1989.