Smoothing methods for complementarity problems and their applications: A survey

Journal of the Operations Research Society of Japan

Volumn 43, Issue 1, 2000, Pages 32-47

  Chen, Xiaojun ^a  

^a SHIMANE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034148176     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.43.32     Document Type: Article

References (64)

1. A. Auslender: How to deal with the unbounded in optimization: Theory and algorithm. Mathematical Programming, 79 (1997) 3-18.
2. S.C. Billups, S.P. Dirkse and M.C. Ferris: A comparison of algorithms for large-scale mixed complementarity problems. Computational Optimization and Applications, 7 (1997) 3-25.
3. J.V. Burke and S. Xu: The global linear convergence of a non-interior path-following algorithm for linear complementarity problems. Mathematics of Operations Research, 23 (1998) 719-734.
4. J.V. Burke and S. Xu: A polynomial time interior-point path-following algorithm for the monotone linear complementarity problem, to appear in Mathematical Programming.
5. 0 NCP or monotone NCP. SIAM Journal on Optimization, 9 (1999) 624- 645.
6. B. Chen and X. Chen: A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints. to appear in Computational Optimization and Applications.
7. B. Chen, X. Chen and C. Kanzow: A Penalized Fischer-Burmeister NCP-function: Theoretical Investigation and Numerical Results. (Department of Management and Systems, Washington State University, Pullman, 1997).
8. B. Chen and P.T. Harker: A non-interior-point continuation method for linear complementarity problems. SIAM on Journal Matrix Analysis and Applications, 14 (1993) 1168-1190.
9. B. Chen and P.T. Harker: A continuation method for monotone variational inequalities. Mathematical Programming, 69 (1995) 237-253.
10. B. Chen and P.T. Harker: Smooth approximations to nonlinear complementarity problems. SIAM Journal on Optimization, 7 (1997) 403-420.
11. 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. SIAM Journal on Optimization, 9 (1999) 605-623.
12. C. Chen and O.L. Mangasarian: Smoothing methods for convex inequalities and linear complementarity problems. Mathematical Programming, 71 (1995) 51-69.
13. 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.
14. X. Chen: On the convergence of Broyden-like methods for nonlinear equations with nondifferentiable terms. Annals of the Institute of Statistical Mathematics, 42 (1990) 387-401.
15. X. Chen: Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations. Journal of Computational and Applied Mathematics, 80 (1997) 105-126.
16. X. Chen and L. Qi: A parameterized Newton method and a Broyden-like method for solving nonsmooth equations. Computational Optimization and Applications, 3 (1994) 157-179.
17. 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.
18. X. Chen and T. Yamamoto: Convergence domains of certain iterative methods for solving nonlinear equations. Numerical Functional Analysis and Optimization, 10 (1989) 37-48.
19. X. Chen and Y. Ye: On homotopy-smoothing methods for box-constrained variational inequalities. SIAM Journal on Control and Optimization, 37 (1999) 589-616.
20. 0 Matrix Linear Complementarity Problem. AMR 98/5, School of Mathematics, University of New South Wales, Sydney, 1998 (Revised May 1999).
21. X. Chen and P. Tseng: Non-interior Continuation Methods for Solving Semidefinite Complementarity Problems. (Department of Mathematics, University of Washington, Seattle, 1999.)
22. B.C. Eaves: On the basic theorem of complementarity. Mathematical Programming, 1 (1971) 68-75.
23. 0 nonlinear complementarity problems. Mathematics of Operations Research, 23 (1998) 735-745.
24. F. Facchinei, H. Jiang and L. Qi: A smoothing method for mathematical programs with equilibrium constraints. Mathematical Programming, 85 (1999) 107-134.
25. F. Facchinei and C. Kanzow: Beyond monotonicity in regularization methods for non-linear complementarity problems. to appear in: SIAM Journal on Control and Optimization.
26. A. Fischer: A special Newton-type optimization method. Optimization, 24 (1992) 269-284.
27. A. Fischer and C. Kanzow: On finite termination of an iterative method for linear complementarity problems. Mathematical Programming, 74 (1996) 279-292.
28. M. Fukushima: Merit functions for variational inequality and complementarity problems. In G.Di Pillo and F. Giannessi (eds.): Nonlinear Optimization and Applications (Plenum Press, New York, NY, 1996), 155-170.
29. 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 Applicationsi, 10 (1998) 5-34.
30. M. Fukushima and J.S. Pang: Convergence of a smoothing continuation method for mathematical programs with equilibrium constraints. to appear in R. Tichatschke(ed.): Proceedings of the Workshop on Ill-posed Variational Problems and Regularization Techniques (Springer-Verlag, Berlin, 1999).
31. M. Fukushima and L. Qi (eds): Reformulation: Nonsmooth, Piecewise Smooth. Semismooth and Smoothing Methods (Kluwer Academic Publishers, 1999).
32. S.A. Gabriel and J.J. Moré: Smoothing of mixed complementarity problems. In: M.C. Ferris and J.S. Pang (eds.): Complementarity and Variational Problems: State of the Art (SIAM, Philadelphia, Pennsylvania, 1997) 105-116.
33. M.S. Gowda and R. Sznajder: Weak univalence and connectedness of inverse images of continuous functions. Mathematics of Operations Research, 24 (1999) 255-261.
34. M. Heinkenschloss, C.T. Kelley and H.T. Tran: Fast algorithms for nonsmooth compact fixed-point problems. SIAM Journal on Numerical Analysis, 29 (1992) 1769-1792.
35. K. Hotta and A. Yoshise: Global convergence of a class of non-interior-point algorithms using Chen-Harker-Kanzow functions for nonlinear complementarity problems. In: Linear Matrix Inequalities and Positive Semidefinite Programming, 1004 (Kyoto University, Research Institute for Mathematical Science, 1997), 40-70.
36. H. Jiang and D. Ralph: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints. (Department of Mathematics & Statistics, University of Melbourne, 1997).
37. C. Kanzow: Some noninterior continuation methods for linear complementarity problems. SIAM Journal on Matrix Analysis and Applications, 17 (1996) 851-868.
38. C. Kanzow and M. Fukushima: Theoretical and numerical investigation of D-gap function for box constrained variational inequalities. Mathematical Programming, 83 (1998) 55-87.
39. C. Kanzow and H. Pieper: Jacobian smoothing methods for general complementarity problems. SIAM Journal on Optimization, 9 (1999) 342-373.
40. C. Kanzow, N. Yamashita and M. Fukushima: New NCP-functions and their properties. Journal of Optimization Theory and Applications, 94 (1997) 115-135.
41. C.T. Kelley: Identification of the support of nonsmoothness. in W.W. Hager, D.W. Hearn and P.M. Pardalos (eds.): Large Scale Optimization: State of the Art (Boston, Kluwer Academic Publishers B.V. 1993), 192-205.
42. M. Kojima, N. Megiddo and T. Noma: Homotopy continuation methods for nonlinear complementarity problems. Mathematics of Operations Research, 16 (1991) 754-774.
43. D.H. Li and M. Fukushima: Smoothing Newton and quasi-Newton methods for mixed complementarity problems. to appear in Computational Optimization and Applications.
44. Z.-Q. Luo and P. Tseng: A new class of merit functions for the nonlinear complementarity problem. in M.C. Ferris and J.-S. Pang (eds): Complementarity and Variational Problems: State of the Art (SIAM, Philadelphia, PA, 1997), 204-225.
45. J.M. Martínez and M.C. Zambaldi: Least change update methods for nonlinear systems with nondifferentiable terms. Numerical Functional Analysis and Optimization, 14 (1993) 405-415.
46. J.-S. Pang: A B-differentiable equations based, globally, and locally quadratically convergent algorithm for nonlinear problems, complementarity and variational inequality problems. Mathematical Programming, 51 (1991) 101-131.
47. J.-S. Pang and L. Qi: Nonsmooth equations: Motivation and algorithms. SIAM Journal on Optimization, 3 (1993) 443-465.
48. 0 function, to appear in: SIAM Journal on Optimization.
49. 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.
50. L. Qi and D. Sun: Smoothing Functions and a Smoothing Newton Method for Complementarity and Variational Inequality Problems (School of Mathematics, The University of New South Wales, 1998).
51. 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, School of Mathematics, the University of New South Wale, 1997).
52. S. Robinson: Normal maps induced by linear transformation. Mathematics of Operations Research, 17 (1992) 691-714.
53. S. Smale: Algorithms for solving equations. Proceedings of the International Congress of Mathematicians (Berkeley, California, 1986), 172-195.
54. D. Sun: A regularized Newton method for solving nonlinear complementarity problems. to appear in: Appled Mathematics and Optimization.
55. D. Sun: Smoothing-nonsmooth Reformulations of Variational Inequality Problems. Preprint (School of Mathematics, the University of New South Wales, Sydney 2052, Australia, October 1998).
56. K. Taji, M. Miyamoto and Y. Takahashi: A smoothing Newton method for nonsmooth equations and its application to complementarity problems (Japanese). in Optimization: Modeling and Algorithms 12 (The Institute of Statistical Mathematics, Tokyo, 1998), 191-208.
57. K.L. Teo, V. Rehbock and L.S. Jennings: A new computational algorithm for functional inequality constrained optimization problems. Automatica, 29 (1993) 789-792.
58. P. Tseng: Growth behaviour of a class of merit functions for the nonlinear complementarity problem. Journal of Optimization Theory and Applications, 89 (1996) 17-37.
59. P. Tseng: Analysis of a non-interior continuation method based on Chen-Mangasarian functions for complementarity problems. in M. Fukushima and L. Qi (eds.): ReformuLation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (Kluwer Academic Publisher, Nowell, Maryland, 1999), 381-404.
60. T. Yamamoto: Split nonsmooth equations and verification of solution. Zeitschrift Für Angewandte Mathematik und Mechanik, 76 (1996) 199-202.
61. N. Yamashita and M. Fukushima: A new merit function for nonlinear complementarity problems (Japanese). Proceedings of the Autumn National Conference of Japan Operation Research Society, (1996) 124-125.
62. I. Zang: A smoothing-out technique for min-max optimization. Mathematical Programming, 19 (1980) 61-71.
63. G. Zhou, D. Sun and L. Qi: Numerical experiments for a class of squared smoothing Newton methods for box constrained variational inequality problems. in M. Fukushima and L. Qi (eds.): Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (Kluwer Academic Publisher, Nowell, Maryland, 1999), 421-441.
64. A.I. Zincenko: Some approximate methods of solving equations with nondifferentiable operators (Ukrainian). Dopovidi Akad. Nauk. Ukrain. RSR (1963) 156-161.