An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
Tóm tắt
In this paper, we present a new QP-free method without using a penalty function for inequality constrained optimization. It is an infeasible method. At each iteration, three linear equations with the same coefficient matrix are solved. The nearly active set technique is used in the algorithm, which eliminates some inactive constraints and reduces the dimension of coefficient matrix, and thereby reduces the amount of computational work. Moreover, the algorithm reduces the value of objective function or the measure of constraints violation according to the relationship between optimality and feasibility. Under common conditions, we prove that the proposed method has global and superlinear local convergence. Lastly, preliminary numerical results are reported.
Tài liệu tham khảo
Boggs PT, Tolle JW (1995) Sequential quadratic programming. In: Acta No., vol 4. Cambridge University Press, Cambridge, pp 1–51
Gill PE, Murray W, Saunders MA (2005) SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev 47:99–131
Panier ER, Tits AL, Herskovits JN (1988) A QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization. SIAM J Control Optim 26:788–811
Qi HD, Qi L (2000) A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization. SIAM J Optim 11:113–132
Qi L, Yang YF (2002) Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization. J Optim Theory Appl 113:297–323
Qiu SQ, Chen ZW (2012) Global and local convergence of a class of penalty-free-type methods for nonlinear programming. Appl Math Model 36:3201–3216
Facchinei F, Fischer A, Kanzow C (1998) On the accurate identification of active constraints. SIAM J Optim 9:14–32
Fletcher R, Leyffer S (2002) Nonlinear programming without a penalty function. Math Prog Ser A 91:239–269
Ulbrich M, Ulbrich S, Vicent N (2004) A globally convergent primal-dual interior-point filter method for nonlinear programming. Math Prog 100:379–410
Chin CM, Rashid AHA, Nor KM (2007) Global and local convergence of a filter line search method for nonlinear programming. Optim Meth Soft 3:365–390
Shen C, Xue W, Chen XD (2010) Global convergence of a robust filter SQP algorithm. Eur J Oper Res 206:34–45
Bueno LF, Friedlander A, Martínez JM, Sobral FNC (2013) Inexact restoration method for derivative-free optimization with smooth constraints. SIAM J Optim 23:1189–1213
Chen LF, Wang YL, He GP (2006) A feasible active set QP-free method for nonlinear programming. SIAM J Optim 17:401–429
Fletcher R, Leyffer S (2002) Nonlinear programming without a penalty function. Math Prog 91:239–269
Yamashita H, Yabe H (2003) A globally convergent trust-region SQP method without a penalty function for nonlinearly constrained optimization. Technical report, Mathematical Systems Inc, Sinjuku-ku, Tokyo, Japan
Conn AR, Gould NIM, Toint PhL (2000) Trust-region methods. SIAM, Philadelphia
Nocedal J, Wright S (1999) Numerical optimization. Springer, New York
Kanzow C, Qi HD (1999) A QP-free constrained Newton-type method for variational inequality problems. Math Pro 85:788–811
Robinson SM (1980) Strongly regular generalized equations. Math Oper Res 5:43–62
Facchinei F, Lucidi S (2002) Quadratically and superlinearly convergent algorithm for large scale box constrained optimization. SIAM J Optim 12:265–289
Hock W, Schittkowski K (1981) Test examples for nonlinear programming codes, vol 187. Lecture notes in economics and mathematical systems. Springer, Berlin
Powell MJJ (1978) The convergence of variable metric methods for nonlinearly constrained optimization calculations. In: Meyer RR, Robinson SM (eds) Nonlinear programming, vol 3. Academic Press, New York
Wang YL, Chen LF, He GP (2005) Sequential systems of linear equations method for general constrained optimization without strict complementarity. J Comput Appl Math 182:447–471
Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91:201–213