Abstract
The authors propose a dwindling filter algorithm with Zhou’s modified subproblem for nonlinear inequality constrained optimization. The feasibility restoration phase, which is always used in the traditional filter method, is not needed. Under mild conditions, global convergence and local superlinear convergence rates are obtained. Numerical results demonstrate that the new algorithm is effective.
Similar content being viewed by others
References
Chen, Y. and Sun, W., A dwindling filter line search method for unconstrained optimization, Technical Report of Optimization No. 2010-09-01, School of Mathematical Science, Nanjing Normal University, Nanjing.
Dolan, E. D. and Moré, J. J., Benchmarking optimization software with performance profiles, Math. Program., 91, 2002, 201–213.
Fletcher, R. and Leyffer, S., Nonlinear programming without a penalty function, Math. Program., 91, 2002, 239–269.
Gu, C. and Zhu, D., A secant algorithm with line search filter method for nonlinear optimization, Appl. Math. Modell., 35, 2011, 879–894.
Hock, W. and Schittkowski, K., Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematics System, Vol. 187, Springer-Verlag, New York, 1981.
Jian, J. B. and Liu, Y., A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization, Nonlinear Anal. Real World Appl., 12, 2011, 2717–2729.
Long, J., Ma, C. F. and Nie, P. Y., A new filter method for solving nonlinear complementarity problems, Appl. Math. Comput., 185, 2007, 705–718.
Li, C. and Sun, W., On filter-successive linearization methods for nonlinear semidefinite programming, Sci. China Ser. A, 52, 2009, 2341–2361.
Nie, P. Y., Sequential penalty quadratic programming filter methods for nonlinear programming, Nonlinear Anal. Real World Appl. 8, 2007, 118–129.
Nie, P. Y., A derivative-free method for the system of nonlinear equations, Nonlinear Anal. Real World Appl., 7, 2006, 378–384.
Nie, P. Y. and Ma, C. F., A trust region filter mehtod for general nonlinear programming, Appl. Math. Comput., 172, 2006, 1000–1017.
Nocedal, J. and Wright, S., Numerical Optimization, Springer-Verlag, New York, 1999.
Shen, C. G., Xue, W. J. and Pu, D. G., A filter SQP algorithm without a feasibility restoration phase, Comp. Appl. Math., 28, 2009, 167–194.
Su, K. and Yu, Z., A modified SQP method with nonmonotone technique and its global convergence, Comput. Math. Appl., 57, 2009, 240–247.
Su, K., A globally and superlinearly convergent modified SQP-filter method, J. Global Optim., 41, 2008, 203–217.
Wächter, A. and Biegler, L. T., Line search filter methods for nonlinear programming: Motivation and global convergence, SIAM J. Optim., 6, 2005, 1–31.
Wächter, A. and Biegler, L. T., Line search filter methods for nonlinear programming: Local convergence, SIAM J. Optim., 6, 2005, 32–48.
Wächter, A. and Biegler, L. T., On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Math. Program., 106, 2006, 225–57.
Zhou, G. L., A modified SQP method and its global convergence, J. Global Optim., 11, 1997, 193–205.
Zhu, Z. B. and Wang, S., A superlinearly convergent numerical algorithm for nonlinear programming, Nonlinear Anal. Real World Appl., 13, 2012, 2391–2402.
Zhu, Z. B. and Jian, J. B., An efficient feasible SQP algorithm for inequality constrained optimization, Nonlinear Anal. Real World Appl., 10, 2009, 1220–1228.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Natural Science Foundation of China (Nos. 11201304, 11371253), the Innovation Program of Shanghai Municipal Education Commission (No. 12YZ174) and the Group of Accounting and Governance Disciplines (No. 10kq03).
Rights and permissions
About this article
Cite this article
Gu, C., Zhu, D. A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization. Chin. Ann. Math. Ser. B 35, 209–224 (2014). https://doi.org/10.1007/s11401-014-0826-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11401-014-0826-z