Local behavior of an iterative framework for generalized equations with nonisolated solutions

Mathematical Programming, Series B

Volumn 94, Issue 1, 2002, Pages 91-124

  Fischer, Andreas ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Error bounds; Generalized equation; Mixed complementarity problem; Newton's method; Nonisolated solutions; Superlinear convergence; Upper Lipschitz continuity

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; ITERATIVE METHODS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

ERROR BOUNDS; GENERALIZED EQUATIONS; MIXED COMPLEMENTARITY PROBLEMS; NEWTON'S METHOD; NONISOLATED SOLUTIONS; SUPERLINEAR CONVERGENCE; UPPER LIPSCHITZ CONTINUITY;

NONLINEAR EQUATIONS;

EID: 14944383664     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0364-4     Document Type: Article

References (32)

1. Billups, S.C.: Algorithms for complementarity problems and generalized equations. Mathematical Programming Technical Report 95-14, Ph.D. Thesis, Computer Sciences Department, University of Wisconsin, Madison, 1995
2. Clarke, F.H.: Optimization and Nonsmooth Analysis. John Wiley and Sons, NY, 1983
3. Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, Boston, 1992
4. Dan, H., Yamashita, N., Fukushima, M.: A superlinearly convergent algorithm for the monotone non-linear complementarity problem without uniqueness and nondegeneracy conditions. Technical Report 2001-004, Department of Applied Mathematics and Physics, Kyoto University, Kyoto, 2001
5. Dontchev, A.L., Rockafellar, R.T.: Characterizations of strong regularity for variational inequalities over polyhedral convex sets. SIAM J. Optim. 6, 1087-1105 (1996)
6. Eaves, B.C.: On the basic theorem of complementarity. Math. Program. 1, 68-75 (1971)
7. Facchinei, F., Fischer, A., Kanzow, C.: On the accurate identification of active constraints. SIAM J. Opt. 9, 14-32 (1998)
8. Fan, J.-Y., Yuan, Y.-X.: On the convergence of a New Levenberg-Marquardt Method. Report, The Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing, 2001
9. Fischer, A.: On the local superlinear convergence of a Newton-type method for LCP under weak conditions. Optim. Meth. Software. 6, 83-107 (1995)
10. Fischer, A.: Modified Wilson's method for nonlinear programs with nonunique multipliers. Math. Oper. Res. 24, 699-727 (1999)
11. Fischer, A.: Merit functions and stability for complementarity problems. In: Fukushima, M., Qi, L., (eds), Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 149-159. Kluwer Academic Publishers, The Netherlands, 1999
12. Hager, W.W.: Stabilized sequential quadratic programming. Comput. Optim. Appl. 12, 253-273 (1999)
13. Hager, W.W., Gowda, S.: Stability in the presence of degeneracy and error estimation. Math. Program. 85, 181-192 (1999)
14. Klatte, D.: On quantitative stability for Non-Isolated Minima. Control Cybernetics 23, 183-200 (1994)
15. Klatte, D., Tammer, K.: Strong stability of stationary solutions and Karush-Kuhn-Tucker points in non-linear optimization. Ann. Oper. Res. 27, 285-308 (1990)
16. Kummer, B.: Metric Regularity: Characterizations, nonsmooth variations and successive approximation. Optimization 46, 247-281 (1999)
17. Li, D.-H-, Qi, L.: A stabilized SQP method via linear equations. Applied Mathematics Report AMR00/5, School of Mathematics, University of New South Wales, Sydney, 2000
18. Luque, F.J.: Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Control Optim. 22, 277-293 (1984)
19. Qi, L., Wei, Z.: On the constant linear dependence condition and its application to an SQP method. SIAM J. Optim. 10, 963-981 (2000)
20. Robinson, S.M.: Strongly regular generalized equations. Math. Oper. Res. 5, 43-62 (1980)
21. Ralph, D., Wright, S.J.: Superlinear convergence of an interior-point method for monotone variational inequalities. In: Ferns, M.C., Pang, J.-S. (eds). Complementarity and Variational Problems: State of the Art, pp. 345-385. SIAM, PA, 1997
22. Ralph, D., Wright, S.J.: Superlinear convergence of an interior-point method despite dependent constraints. Preprint ANL/MCS-P622-1196 (revised August, 1998), Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1996
23. Robinson, S.M.: Generalized equations and their solutions, Part II: Applications to nonlinear programming. Math. Program. Stud. 19, 200-221 (1982)
24. Robinson, S.M.: Newton's method for a class of nonsmooth functions. Set-Valued Analysis 2, 291-305 (1994)
25. Rockafellar, R.T., Wets, J.-B.: Variational Analysis. Springer, Berlin, 1998
26. Sturm, J.F.: Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists. Math. Oper. Res. 24, 72-94 (1999)
27. Tseng, P.: Error bounds and superlinear convergence analysis of some Newton-type methods in optimization. In: Di Pillo, G., Giannessi, F. (eds), Nonlinear Optimization and Related Topics, pp. 445-462. Kluwer Academic Publishers, Boston, 2000
28. Wright, S.J.: Modifying SQP for degenerate problems. Preprint ANL/MCS-P699-1097 (last modified June, 2000.), Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1997
29. Wright, S.J.: Superlinear convergence of a stabilized SQP method to a degenerate solution. Comput. Optim. Appl. 11, 253-275 (1998)
30. Yamashita, N., Dan, H., Fukushima, M.: On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm. Technical Report 2001-003, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, 2001
31. Yamashita, N., Fukushima, M.: The proximal point algorithm with genuine superlinear convergence for the monotone complementarity problem. SIAM J. Opt. 11, 364-379 (2001)
32. Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg-Marquardt method. Computing 15, 239-249 (2001)