×
Guo, Chuan-Hao; Bai, Yan-Qin; Jian, Jin-Bao

An improved sequential quadratic programming algorithm for solving general nonlinear programming problems. (English) Zbl 1306.90174

J. Math. Anal. Appl. 409, No. 2, 777-789 (2014).
Summary: In this paper, a class of general nonlinear programming problems with inequality and equality constraints is discussed. Firstly, the original problem is transformed into an associated simpler equivalent problem with only inequality constraints. Then, inspired by the ideals of the sequential quadratic programming (SQP) method and the method of system of linear equations (SLE), a new type of SQP algorithm for solving the original problem is proposed. At each iteration, the search direction is generated by the combination of two directions, which are obtained by solving an always feasible quadratic programming (QP) subproblem and a SLE, respectively. Moreover, in order to overcome the Maratos effect, the higher-order correction direction is obtained by solving another SLE. The two SLEs have the same coefficient matrices, and we only need to solve the one of them after a finite number of iterations. By a new line search technique, the proposed algorithm possesses global and superlinear convergence under some suitable assumptions without the strict complementarity. Finally, some comparative numerical results are reported to show that the proposed algorithm is effective and promising.

Cited in 2 Documents

MSC:

90C55 Methods of successive quadratic programming type
90C30 Nonlinear programming

Keywords:

general nonlinear programming; sequential quadratic programming; method of quasi-strongly sub-feasible directions; global convergence; superlinear convergence

Software:

SNOPT
Cite Review PDF
Full Text: DOI arXiv

References:

[1] Cai, J.; Li, Q.; Li, L.; Peng, H.; Yang, Y., A hybrid FCASO-SQP method for solving the economic dispatch problems with valve-point effects, Energy (2012)
[2] Dolan, E.; Moré, J., Benchmarking optimization software with performance profiles, Math. Program., 91, 201-213 (2002) · Zbl 1049.90004
[3] Gill, P.; Murray, W.; Saunders, M., Snopt: an SQP algorithm for large-scale constrained optimization, SIAM Rev., 47, 99-131 (2005) · Zbl 1210.90176
[4] Gould, N.; Orban, D.; Toint, P., A constrained and unconstrained testing environment, revisited, ACM Trans. Math. Software, 29, 373-394 (2003) · Zbl 1068.90526
[5] Gu, C.; Zhu, D., A non-monotone line search multidimensional filter-SQP method for general nonlinear programming, Numer. Algorithms, 56, 537-559 (2011) · Zbl 1216.65071
[7] Herskovits, J., A two-stage feasible directions algorithm for nonlinear constrained optimization, Math. Program., 36, 19-38 (1986) · Zbl 0623.90070
[8] Herskovits, J.; Carvalho, L., A successive quadratic programming based feasible directions algorithm, Anal. Optim. Syst., 83, 93-101 (1986) · Zbl 0597.90079
[9] Hock, W.; Schittkowski, K., Test examples for nonlinear programming codes, J. Optim. Theory Appl., 30, 127-129 (1980) · Zbl 0393.90072
[10] Jian, J.; Chen, Y.; Guo, C., A strongly convergent method of quasi-strongly sub-feasible directions for constrained optimization, Pac. J. Optim., 7, 339-351 (2011) · Zbl 1254.90229
[11] Jian, J.; Guo, C.; Yang, L., A new generalized projection method of strongly sub-feasible directions for genaral constrained optimization, Pac. J. Optim., 5, 507-523 (2009) · Zbl 1200.90153
[12] Jian, J.; Ke, X.; Zheng, H.; Tang, C., A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization, J. Comput. Appl. Math., 223, 1013-1027 (2009) · Zbl 1160.90007
[13] Jian, J.; Tang, C.; Hu, Q.; Zheng, H., A new superlinearly convergent strongly subfeasible sequential quadratic programming algorithm for inequality-constrained optimization, Numer. Funct. Anal. Optim., 29, 376-409 (2008) · Zbl 1176.90570
[14] Jin, Z.; Wang, Y., A type of efficient feasible SQP algorithms for inequality constrained optimization, Appl. Math. Comput., 215, 3589-3598 (2010) · Zbl 1192.65078
[15] Lawrence, C.; Tits, A., Nonlinear equality constraints in feasible sequential quadratic programming, Optim. Methods Softw., 6, 252-282 (1996)
[17] Mayne, D.; Polak, E., Feasible direction algorithm for optimization problems with equality and inequality constraints, Math. Program., 11, 67-80 (1976) · Zbl 0351.90067
[18] Panier, E.; Tits, A., A superlinearly convergent feasible method for the solution of inequality constrained optimization problems, SIAM J. Control Optim., 25, 934-950 (1987) · Zbl 0634.90054
[19] Panier, E.; Tits, A., On combining feasibility, descent and superlinear convergence in inequality constrained optimization, Math. Program., 59, 261-276 (1993) · Zbl 0794.90068
[20] Pantoja, J.; Mayne, D., Exact penalty function algorithm with simple updating of the penalty parameter, J. Optim. Theory Appl., 69, 441-467 (1991) · Zbl 0724.90065
[21] Qi, L.; Yang, Y., A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization, J. Global Optim., 21, 157-184 (2001) · Zbl 1068.90615
[22] Spellucci, P., An SQP method for general nonlinear problems using only equality constrained subproblems, Math. Program., 82, 413-448 (1998) · Zbl 0930.90082
[23] Wang, Y.; Chen, L.; He, G., Sequential systems of linear equations method for general constrained optimization without strict complementarity, J. Comput. Appl. Math., 182, 447-471 (2005) · Zbl 1078.65055
[24] Yang, Y.; Li, D.; Qi, L., A feasible sequential system of linear equations method for inequality constrained optimization, SIAM J. Optim., 13, 1222-1244 (2003) · Zbl 1101.90394
[25] Zhang, X.; Liu, Z.; Liu, S., A trust region SQP-filter method for nonlinear second-order cone programming, Comput. Math. Appl. (2012) · Zbl 1252.90060
[26] Zhu, Z.; Zhang, W.; Geng, Z., A feasible SQP method for nonlinear programming, Appl. Math. Comput., 215, 3956-3969 (2010) · Zbl 1185.65103
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.