Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-25T07:00:11.014Z Has data issue: false hasContentIssue false
  • English
  • Français

On the convergence of an iterative method for the minimax problem

Published online by Cambridge University Press:  17 February 2009

Wenyu Sun
Wenyu Sun
Affiliation:
Department of Mathematics, Nanjing University, Nanjing 210093, China
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we present an Extended Linear-Quadratic Programming method for the minimax problem. We show that the Extended Linear-Quadratic Programming method for the minimax problem is equivalent to the Josephy-Newton method for generalized equation, and establish the local convergence result. Furthermore, we obtain the global convergence result for the minimax problem by means of the equivalence relation between the generalized equation and the normal equation.

Type
Research Article
Information
The ANZIAM Journal , Volume 39 , Issue 2 , October 1997 , pp. 280 - 292
Copyright
Copyright © Australian Mathematical Society 1997

References

[1]Grippo, L., Lampariello, F. and Lucidi, S., “A nonmonotone line search technique for Newton's method”, SIAM Journal of Numerical Analysis 23 (1986) 707–716.CrossRefGoogle Scholar
[2]Josephy, N. H., “Newton's method for generalized equations”, National Technical Information Service, (Springfield, VA 22161, USA. Accession number AD A077 096).Google Scholar
[3]Josephy, N. H., “Quasi-newton methods for generalized equations”, National Technical Information Service, (Springfield, VA 22161, USA. Accession number AD A077 096).Google Scholar
[4]Moré, J. J. “Recent developments in algorithms and software for trust region methods”, in Mathematical Programming, The State of Art, Bonn 1982 (eds. Bachem, A., Grötschel, M. and Korte, B.), (Springer-Verlag, Berlin, 1983) 258–287.CrossRefGoogle Scholar
[5]Murray, W. and Overton, M. L., “A projected Langrangian algorithm for nonlinear minimax optimization”, SIAM J. Sci. Stat. Comp. 1 (1980) 345–370.CrossRefGoogle Scholar
[6]Oettli, W., “The method of feasible directions for continuous minimax problems”, in Survey in Mathematical Programming (ed. Prekopa, A.), Volume 1, (North-Holland, Amsterdam, 1979) 505–512.Google Scholar
[7]Ortega, J. M. and Rheinboldt, W. C., Iterative Solution of nonlinear equations of several variables (Academic Press, San Diego, 1970).Google Scholar
[8]Pang, J. S., “Newton's method for B-differentiable equations”, Mathematics of Operations Research 15 (1990) 311–341.CrossRefGoogle Scholar
[9]Polak, E., “On the mathematical foundations of nondifferentiable optimization”, SIAM Review 29 (1987) 21–87.CrossRefGoogle Scholar
[10]Polak, E., Higgins, J. E. and Mayne, D. Q., “A barrier function method for minimax problems”, Mathematical Programming 54 (1992) 155–176.CrossRefGoogle Scholar
[11]Powell, M. J. D., “Convergence properties of a class of minimization algorithm”, in Nonlinear Programming 2 (eds. Mangasarian, O. L., Meyer, R. R. and Robonson, S. M.), (Academic Press, New York, 1975).Google Scholar
[12]Powell, M. J. D., “Variable metric methods for constrained optimization”, in Mathematical Programming, The State of Art, Bonn 1982 (eds. Bachem, A., Grötschel, M. and Korte, B.), (Springer-Verlag, Berlin, 1983) 288–311.CrossRefGoogle Scholar
[13]Qi, L. and Sun, W., “An iterative method for the minimax problem”, in Minimax and Applications (eds. Du, D. Z. and Pardalos, P. M.), (Kulwer Academic Publisher, Boston, 1995) 55–67.CrossRefGoogle Scholar
[14]Ralph, D., “Global convergence of damped Newton's method for nonsmooth equations, via the path search”, Mathematics of Operations Research 19 (1994) 352–389.CrossRefGoogle Scholar
[15]Robinson, S. M., “Generalized equation and their solutions, Part I: Basic theory”, Mathematical Programming Study 10 (1979) 128–141.CrossRefGoogle Scholar
[16]Robinson, S. M., “Strongly regular generalized equations”, Mathematics of Operations Research 5 (1980) 43–62.CrossRefGoogle Scholar
[17]Robinson, S. M., “Normal maps induced by linear transformations”, Mathematics of Operations Research 17 (1992) 691–714.CrossRefGoogle Scholar
[18]Rockafellar, R. T., “Linear-quadratic programming and optimal control”, SIAM Journal on Control and Optimization 25 (1987) 781–814.CrossRefGoogle Scholar
[19]Rockafellar, R. T., “Computational schemes for large-scale problems in extended linear-quadratic programming”, Mathematical Programming 48 (1990) 447–474.CrossRefGoogle Scholar
[20]Rockafellar, R. T. and Wets, R. J.-B., “A dual solution procedure for quadratic stochastic programs with simple recourse”, in Numerical Methods, Lecture Notes in Mathematics 1005 (ed. Reinoza, A.), (Springer-Verlag, Berlin, 1983) 252–265.Google Scholar
[21]Sun, W., “Newton's method and quasi-Newton-SQP method for general constrained optimization”, to appear in Applied Mathematics and Computation (1997).Google Scholar
[22]Sun, W. and Yuan, Y., Optimization Theory and Methods (Science Press, Beijing, 1997).Google Scholar
[23]Sussman-Fort, S. E., “Approximate direct-search minimax circuit optimization”, International J. for Numerical Methods in Engineering 28 (1989) 751–783.CrossRefGoogle Scholar
[24]Zhu, C. and Rockafellar, R. T., “Primal-dual projected gradient algorithms for extended linear quadratic programming”, SIAM J. Optimization 3 (1993) 751–783.CrossRefGoogle Scholar