×

A modified SQP algorithm for minimax problems. (English) Zbl 1178.90345

This paper deals with nonlinear minimax problems and a Sequential Quadratic Programming (SQP) method. In this paper, the authors propose a modified nonmonotone line search SQP algorithm for nonlinear minimax problems. During each iteration of the proposed algorithm, a main search direction is obtained by solving a reduced quadratic program (QP). In order to avoid the Maratos effect, a correction direction is generated by solving the reduced system of linear equations. Under mild conditions, the global and superlinear convergence can be achieved. Preliminary numerical results show that the proposed algorithm may be effective.

MSC:

90C47 Minimax problems in mathematical programming
90C55 Methods of successive quadratic programming type
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Mayne, D. Q.; Polak, E.; Sangiovanni-Vincenteli, A., Computer-aided design via optimization: A review, Auto., 18, 147-154 (1982) · Zbl 0478.93021
[2] Polak, E.; Mayne, D. Q.; Stimler, D. M., Control system design via semi-infinite optimization: A review, Proc. IEEE, 72, 1777-1794 (1984)
[3] S.E. Salcudean, Algorithms for optimal design of feedback compensators, PhD thesis, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, 1986; S.E. Salcudean, Algorithms for optimal design of feedback compensators, PhD thesis, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, 1986
[4] T.L.S. Wuu, Delightmimo: An interactive system for optimization-based multivariable control system design, PhD thesis, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, 1986; T.L.S. Wuu, Delightmimo: An interactive system for optimization-based multivariable control system design, PhD thesis, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, 1986
[5] Han, S. P., Variable metric methods for minimizing a class of nondifferentiable functions, Math. Program., 20, 1-13 (1981) · Zbl 0441.90095
[6] Mayne, D. Q.; Polak, E., A superlinearly convergent algorithm for constrained optimization problems, Math. Program., 16, 45-61 (1982) · Zbl 0477.90071
[7] Panier, E. R.; Tits, A. L., A superlinearly convergent feasible method for the solution of inequality constrained optimization problems, SIAM J. Control Optim., 25, 934-950 (1987) · Zbl 0634.90054
[8] Panier, E. R.; Tits, A. L., On combining feasibility, descent and superlinear convergence in inequality constrained optimization, Math. Program., 59, 261-276 (1993) · Zbl 0794.90068
[9] Qi, H. D.; Qi, L. Q., A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality optimization, SIAM J. Optim., 11, 113-132 (2000) · Zbl 0999.90038
[10] Jian, J. B.; Zhang, K. C.; Xue, S. J., A superlinearly and quadratically convergent SQP type feasible method for constrained optimization, Appl. Math. J. Chinese Univ. Ser. B, 15, 319-331 (2000) · Zbl 0988.90051
[11] Jian, J. B.; Tang, C. M., An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity, Comput. Math. Appl., 49, 223-238 (2005) · Zbl 1075.90072
[12] Powell, M. J.D., A fast algorithm for nonlinearly constrained optimization calculation, (Proceedings of 1977 Dundee Biennial Conference on Numerical Analysis (1978), Springer: Springer Berlin), 144-157 · Zbl 0453.90081
[13] Han, S. P., A globally convergent method for nonlinear programming, J. Optim. Theory Appl., 22, 297-309 (1977) · Zbl 0336.90046
[14] A.R. Conn, Y. Li, An efficient algorithm for nonlinear minimax problems, Report CS-88-41, University of Waterloo, Waterloo, Ontario, Canada, 1989; A.R. Conn, Y. Li, An efficient algorithm for nonlinear minimax problems, Report CS-88-41, University of Waterloo, Waterloo, Ontario, Canada, 1989
[15] Luskan, L., A compact variable metric algorithm for nonlinear minimax approximation, Comput., 36, 355-373 (1986) · Zbl 0573.90077
[16] Polak, E.; Mayne, D. Q.; Higgins, J. E., A superlinearly convergent algorithm for minimax problems, (Proceedings of the 28th IEEE Conference on Decision and Control (1989), Tampa: Tampa Florida), 894-898 · Zbl 0724.90066
[17] Polak, E.; Mayne, D. Q.; Higgins, J. E., Superlinearly convergent algorithm for min-max problems, J. Optim. Theory Appl., 69, 407-439 (1991) · Zbl 0724.90066
[18] Polyak, R. A., Smooth optimization methods for minimax problems, SIAM J. Control Optim., 26, 1274-1286 (1988) · Zbl 0657.90075
[19] Zhou, J. L.; Tits, A. L., Nonmonotone line search for minimax problems, J. Optim. Theory Appl., 76, 455-476 (1993) · Zbl 0792.90079
[20] Xue, Y., The sequential quadratic programming method for solving minimax problem, J. Systems Sci. Math. Sci., 22, 355-364 (2002), (in Chinese) · Zbl 1046.90104
[21] Yu, Y. H.; Gao, L., Nonmonotone line search algorithm for constrained minimax problems, J. Optim. Theory Appl., 115, 419-446 (2002) · Zbl 1039.90089
[22] Facchinei, F.; Fischer, A.; Kanzow, C., On the accurate identification of active constraints, SIAM J. Optim., 9, 14-32 (1999) · Zbl 0960.90080
[23] Gao, Z. Y.; He, G. P.; Wu, F., A method of sequential systems of linear equations with arbitrary initial point, Sci. China Ser. A, 27, 24-33 (1997)
[24] De, J. F.A.; Pantoja, O.; Mayne, D. Q., Exact penalty function algorithm with simple updating of the penalty parameter, J. Optim. Theory Appl., 69, 441-467 (1991) · Zbl 0724.90065
[25] J.B. Jian, Researches on superlinearly and quadratically convergent algorithms for nonlinearly constrained optimization, PhD thesis, School of Science, Xi’an Jiaotong University, Xi’an, China, 2000; J.B. Jian, Researches on superlinearly and quadratically convergent algorithms for nonlinearly constrained optimization, PhD thesis, School of Science, Xi’an Jiaotong University, Xi’an, China, 2000
[26] Mangasarian, O. L.; Fromovitz, S., The Fritz John necessary optimality conditions in the presence of equality and inequality constraints, J. Math. Anal. Appl., 17, 37-47 (1967) · Zbl 0149.16701
[27] Vardi, A., New minimax algorithm, J. Optim. Theory Appl., 75, 613-634 (1992) · Zbl 0792.90076
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.