Abstract
This paper is concerned with an improved feasible sequential quadratic programming (FSQP) method which solves an inequality constrained nonlinear optimization problem. As compared with the existing SQP methods, at each iteration of our method, the base direction is only necessary to solve a equality constrained quadratic programming, the feasible direction and the high-order revised direction which avoids Maratos effect are obtained by explicit formulas. Furthermore, the global and superlinear convergence are proved under some suitable conditions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boggs, P.T., Tolle, J.W.: A Strategy for Global Convergence in a Sequential Quadratic Programming Algorithm. SIAM J. Num. Anal. 26, 600–623 (1989)
Han, S.P.: Superlinearly Convergent Variable Metric Algorithm for General Nonlinear Programming Problems. Mathematical Programming 11, 263–282 (1976)
Powell, M.J.D.: A Fast Algorithm for Nonlinearly Constrained Optimization Calculations. In: Waston, G.A. (ed.) Numerical Analysis, pp. 144–157. Springer, Berlin (1978)
Panier, E.R., Tits, A.L.: On Combining Feasibility, Descent and Superlinear Convergence in Inequality Constrained Optimization. Mathematical Programming 59, 261–276 (1993)
Spellucci, P.: An SQP Method for General Nonlinear Programs Using Only Equality Constrained Subproblems. Mathematical Programming 82, 413–448 (1998)
Lawarence, C.T., Tits, A.L.: A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm. SIAM J. Optim. 11, 1092–1118 (2001)
Qi, L., Yang, Y.F.: Globally and Superlinearly Convergent QP-free Algorithm for Nonlinear Constrained Optimization. JOTA 113, 297–323 (2002)
Zhu, Z.B., Zhang, W.D., Geng, Z.J.: A feasible SQP method for nonlinear programming. Applied Mathematics and Computation 215, 3956–3969 (2010)
Luo, Z.J., Chen, G.H., Liang, J.L.: A variant of feasible descent SQP method for inequality constrained optimization. International Journal of Pure and Applied Mathematics 61(2), 161–168 (2010)
Gu, C., Zhu, D.T.: A non-monotone line search multidimensional filter-SQP method for general nonlinear programming. Numerical Algorithms 56(4), 537–559 (2011)
Hao, C.L., Liu, X.W.: A trust-region filter-SQP method for mathematical programs with linear complementarity constraints. Journal of Industrial and Management Optimization (JIMO) 7(4), 1041–1055 (2011)
Hao, C.L., Liu, X.W.: Globao convergence of an SQP algorithm for nonlinear optimization with overdetermined constraints. Numerical Algebra Control and Optimization 2(1), 19–29 (2012)
Binnans, J.F., Launay, G.: Sequential quadratic programming with penalization the displacement. SIAM J. Optimization 54(4), 796–812 (1995)
Jian, J.B., Tang, C.M.: An SQP Feasible Descent Algorithm for Nonlinear Inequality Constrained Optimization Without Strict Complementarity. An International Journal Computers and Mathematics with Application 49, 223–238 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luo, Z., Zhu, Z., Chen, G. (2012). Modifying Feasible SQP Method for Inequality Constrained Optimization. In: Liu, B., Ma, M., Chang, J. (eds) Information Computing and Applications. ICICA 2012. Lecture Notes in Computer Science, vol 7473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34062-8_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-34062-8_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34061-1
Online ISBN: 978-3-642-34062-8
eBook Packages: Computer ScienceComputer Science (R0)