Global convergence of a tri-dimensional filter SQP algorithm based on the line search method. (English) Zbl 1155.90023
Authors’ abstract: We propose a new filter line search successive quadratic programming (SQP) method in which the violations of equality and inequality constraints are considered separately. Thus the filter in our algorithm is composed by three components: objective function value, equality and inequality constraints violations. The filter with three components accepts reasonable steps flexibly, comparing that with two components. The new filter shares some features with the Ch.-M. Chin and R. Fletcher’s approach [Math. Program. 96, No.1 (A), 161–177 (2003; Zbl 1023.90060)], namely the “slanting envelope” and the “inclusion property”. Under mild conditions, the filter line search SQP method is proven to be globally convergent. Numerical experiments also show the efficiency of our method.
Reviewer: Klaus Schittkowski (Bayreuth)
Citations:
Zbl 1023.90060References:
| [1] | Audet, C.; Dennis, J. E., A pattern search filter method for nonlinear programming without derivatives, SIAM Journal on Optimization, 14, 980-1010 (2004) · Zbl 1073.90066 |
| [2] | Bellavia, S.; Macconi, M.; Morini, B., STRSCNE: A scaled trust region solver for constrained nonlinear equations, Computational Optimization and Applications, 28, 31-50 (2004) · Zbl 1056.90128 |
| [3] | Bellavia, S.; Macconi, M.; Morini, B., STRSCNE (2007) |
| [4] | Benson, H. Y.; Shanno, D. F.; Vanderbei, R., Interior-point methods for nonconvex nonlinear programming jamming and numerical test, Mathematical Programming, 99, 35-48 (2004) · Zbl 1055.90068 |
| [5] | Chin, C. M.; Fletcher, R., On the global convergence of an SLP-filter algorithm that takes EQP steps, Mathematical Programming, 96, 161-177 (2003) · Zbl 1023.90060 |
| [6] | Dennis, J. E.; El-Alem, M.; Williamson, K., A trust-region approach to nonlinear systems of equalities and inequalities, SIAM Journal on Optimization, 9, 291-315 (1999) · Zbl 0957.65058 |
| [7] | Dolan, E. D.; Moré, J., Benchmarking optimization software with performance profiles, Mathematical Programming, 91, 201-213 (2002) · Zbl 1049.90004 |
| [8] | Fletcher, R.; Gould, N. I.M.; Leyffer, S.; Toint, Ph. L.; Wächter, A., Global convergence of a trust region SQP-filter algorithms for general nonlinear programming, SIAM Journal on Optimization, 13, 635-659 (2002) · Zbl 1038.90076 |
| [9] | Fletcher, R.; Leyffer, S., Nonlinear programming without a penalty function, Mathematical Programming, 91, 239-269 (2002) · Zbl 1049.90088 |
| [10] | Fletcher, R.; Leyffer, S.; Toint, Ph. L., On the global convergence of a trust-region SQP-filter algorithm, SIAM Journal on Optimization, 13, 44-59 (2002) · Zbl 1029.65063 |
| [11] | R. Fletcher, S. Leyffer, Ph.L. Toint, On the global convergence of a SLP-filter algorithm, Numerical Analysis Report NA/183, Department of Mathematics, University of Dundee, Scotland, 1998; R. Fletcher, S. Leyffer, Ph.L. Toint, On the global convergence of a SLP-filter algorithm, Numerical Analysis Report NA/183, Department of Mathematics, University of Dundee, Scotland, 1998 |
| [12] | Francisco, J. B.; Krejic, N.; Martínez, J. M., An interior-point method for solving box-constrained underdetermined nonlinear systems, Journal of Computational and Applied Mathematics, 177, 67-88 (2005) · Zbl 1064.65035 |
| [13] | Gill, Ph. E.; Murray, W.; Saunders, M. A., SNOPT: An SQP algorithm for large-scale constrained optimization, SIAM Review, 47, 99-131 (2005) · Zbl 1210.90176 |
| [14] | Gonzaga, C. C.; Karas, E.; Vanti, M., A globally convergent filter method for nonlinear programming, SIAM Journal on Optimization, 14, 646-669 (2004) · Zbl 1079.90129 |
| [15] | Gould, N. I.M.; Leyffer, S.; Toint, Ph. L., A multidimensional filter algorithm for nonlinear equations and nonlinear least squares, SIAM Journal on Optimization, 15, 17-38 (2005) · Zbl 1075.65075 |
| [16] | Gould, N. I.M.; Sainvitu, C.; Toint, Ph. L., A filter trust region method for unconstrained optimization, SIAM Journal on Optimization, 16, 341-357 (2005) · Zbl 1122.90074 |
| [17] | N.I.M. Gould, Ph.L. Toint, FILTRANE: A Fortran 95 filter trust region package for solving systems of nonlinear equalities, nonlinear inequalities and nonlinear least-squares problems, Tech. Report 03/15, Rutherford Appleton Laboratory, Chilton, Oxfordshire, England, 2003; N.I.M. Gould, Ph.L. Toint, FILTRANE: A Fortran 95 filter trust region package for solving systems of nonlinear equalities, nonlinear inequalities and nonlinear least-squares problems, Tech. Report 03/15, Rutherford Appleton Laboratory, Chilton, Oxfordshire, England, 2003 |
| [18] | Gould, N. I.M.; Toint, Ph. L., Global convergence of a hybrid trust region SQP-filter algorithm for general nonlinear programming, (Sachs, E.; Tichatschke, R., System Modeling and Optimization XX (2003), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht, The Netherlands), 23-54 · Zbl 1063.90052 |
| [19] | Hock, W.; Schittkowski, K., Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, vol. 187 (1981), Springer-Verlag: Springer-Verlag Berlin · Zbl 0452.90038 |
| [20] | Macconi, M.; Morini, B.; Porcelli, M., Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities · Zbl 1165.65030 |
| [21] | Nie, P. Y., A filter method for solving nonlinear complementarity problems, Applied Mathematics and Computation, 167, 677-694 (2005) · Zbl 1082.65062 |
| [22] | Nie, P. Y., Sequential penalty quadratic programming filter methods for nonlinear programming, Nonlinear Analysis: Real World Applications, 8, 118-129 (2007) · Zbl 1168.90018 |
| [23] | Powell, M. J.D., A fast algorithm for nonlinearly constrained optimization calculations, (Watson, G. A., Numerical Analysis. Numerical Analysis, Dundee (1977), Springer-Verlag: Springer-Verlag Berlin), 144-157 · Zbl 0374.65032 |
| [24] | Pu, D.; Gui, S.; Tian, W., A class of revised Broyden algorithms without exact line search, Journal of Computational Mathematics, 22, 11-20 (2004) · Zbl 1056.65060 |
| [25] | Pu, D.; Tian, W., A class of modified Broyden algorithms without exact line search, Applied Mathematics - A Journal of Chinese Universities, 10, 313-322 (1995) · Zbl 0842.65042 |
| [26] | Ulbrich, S., On the superlinear local convergence of a filter-SQP method, Mathematical Programming, 100, 217-245 (2004) · Zbl 1146.90525 |
| [27] | Ulbrich, M.; Ulbrich, S.; Vicente, L. N., A globally convergent primal-dual interior filter method for nonconvex nonlinear programming, Mathematical Programming, 100, 379-410 (2004) · Zbl 1070.90110 |
| [28] | Vanderbei, R. J., Vanderbeis AMPL Collection (2007) |
| [29] | Wätcher, A.; Biegler, L. T., Line search filter methods for nonlinear programming: Motivation and global convergence, SIAM Journal on Optimization, 16, 1-31 (2005) · Zbl 1114.90128 |
| [30] | Wätcher, A.; Biegler, L. T., Line search filter methods for nonlinear programming: Local convergence, SIAM Journal on Optimization, 16, 32-48 (2005) · Zbl 1115.90056 |
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.
