Hostname: page-component-6bf8c574d5-h6jzd Total loading time: 0.001 Render date: 2025-02-26T21:21:23.982Z Has data issue: false hasContentIssue false
  • English
  • Français

A sequential quadratic programming algorithm for nonlinear minimax problems

Published online by Cambridge University Press:  17 April 2009

Qing-Jie Hu  and
Ju-Zhou Hu
Qing-Jie Hu
Affiliation:
Department of Information, Hunan Business College, 410205, Changsha, Peoples Republic China e-mail: [email protected]
Ju-Zhou Hu
Affiliation:
Institute of Applied Mathematics, Hunan University, 410082, Changsha, Peoples Republic of China
Rights & Permissions [Opens in a new window]

Extract

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, an active set sequential quadratic programming algorithm with non-monotone line search for nonlinear minmax problems is presented. At each iteration of the proposed algorithm, a main search direction is obtained by solving a reduced quadratic program which always has a solution. In order to avoid the Maratos effect, a correction direction is yielded by solving the reduced system of linear equations. Under mild conditions without the strict complementarity, the global and superlinear convergence can be achieved. Finally, some preliminary numerical experiments are reported.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 76 , Issue 3 , December 2007 , pp. 353 - 368
Copyright
Copyright © Australian Mathematical Society 2007

References

[1]Conn, A.R. and Li, Y., ‘An efficient algorithm for nonlinear minimax problems’, Report CS-88−41, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
[2]De, J.F.A., Pantoja, O. and Mayne, D.Q., ‘Exact penalty function algorithm with simple updating of the penalty parameter’, J. Optim. Theory Appl. 69 (1991), 441–467.Google Scholar
[3]Gao, Z.-Y., He, G.-P. and Wu, F., ‘A method of sequential systems of linear equations with arbitary initial point’, Sci. China Ser. A 27 (1997), 24–33.Google Scholar
[4]Han, S.P., ‘A globally convergent method for nonlinear programming’, J. Optim. Theory Appl. 22 (1977), 297–309.CrossRefGoogle Scholar
[5]Han, S.P., ‘Variable metric methods for minimizing a class of nondifferentiable functions’, Math. Programming 20 (1981), 1–13.CrossRefGoogle Scholar
[6]Jian, J.-B., Researches on superlinearly and quadratically convergent algorithms for nonlinearly constrained optimization, (Ph. D. Thesis) (School of Xi'an Jiaotong University, Xi'an, China, 2000).Google Scholar
[7]Jian, J.-B. and Tang, C.-M., ‘An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity’, Comput. Math. Appl. 49 (2005), 223–238.Google Scholar
[8]Jian, J.-B., Zhang, K.-C. and Xue, S.-J., ‘A superlinearly and quadratically convergent SQP type feasible method for constrained optimization’, Appl. Math. J. Chinese Univ. Ser. B 15 (2000), 319–331.Google Scholar
[9]Luskan, L., ‘A compact variable metric algorithm for nonlinear minimax approximation’, Computing 36 (1986), 355–373.Google Scholar
[10]Mayne, D.Q. and Polak, E., ‘A superlinearly convergent algorithm for constrained optimization problems’, Math. Programming Stud. 16 (1982), 45–61.CrossRefGoogle Scholar
[11]Mayne, D.Q., Polak, E. and Sangiovanni-Vincenteli, A., ‘Computer-aided design via optimization: A review’, Automatica 18 (1982), 147–154.CrossRefGoogle Scholar
[12]Panier, E.R. and Tits, A.L., ‘On combining feasibility, descent and superlinear convergence in inequality constrained optimization’, Math. Programming 59 (1993), 261–276.CrossRefGoogle Scholar
[13]Polyak, R.A., ‘Smooth optimization methods for minimax problems’, SIAM J. Control Optim. 26 (1988), 1274–1286.CrossRefGoogle Scholar
[14]Polak, E., Mayne, D.Q. and Higgins, J.E., ‘A Superlinearly convergent algorithm for minimax problems’,Proceedings of the 28th IEEE Conference on Decision and Control,Tampa, Florida1 (1989), 894–898.Google Scholar
[15]Polak, E., Mayne, D.Q. and Higgins, J.E., ‘Superlinearly convergent algorithm for min-max problems’, J. Optim. Theory Appl. 69 (1991), 407–439.CrossRefGoogle Scholar
[16]Polak, E., Mayne, D.Q. and Stimler, D.M., ‘Control system design via semi-infinite optimization: A review’, Proceedings of the IEEE 72 (1984), 1777–1794.Google Scholar
[17]Powell, M.J.D., ‘A fast algorithm for nonlinearly constrained optimization calculation’,in Numerical Analysis (Proc. 7th Biennial Conf., Univ.Dundee,1977), Lecture Notes in Math. 630 (Springer-Verlag, Berlin, 1978), pp. 144–157.CrossRefGoogle Scholar
[18]Salcudean, S.E., Algorithms for optimal design of feedback compensators, (Ph.D. Thesis) (Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, 1986).Google Scholar
[19]Vardi, A., ‘New minimax algorithm’, J. Optim. Theory Appl. 75 (1992), 613–634.CrossRefGoogle Scholar
[20]Wuu, T.L.S., Delightmimo: An interactive system for optimization-based multivariable control system design, Ph.D. Thesis (Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, 1986).Google Scholar
[21]Yi, X., ‘The sequential quadratic programming method for solving minimax problem’, J. Systems Sci. Math. Sci. 22 (2002), 355–364.Google Scholar
[22]Yu, Y.H. and Gao, L., ‘Nonmonotone line search algorithm for constrained minimax problems’, J. Optim. Theory Appl. 115 (2002), 419–446.CrossRefGoogle Scholar
[23]Zhou, J.L. and Tits, A.L., ‘Nonmonotone line search for minimax problems’, J. Optim. Theory Appl. 76 (1993), 455–476.CrossRefGoogle Scholar