In this paper, a modified nonmonotone QP-free method without penalty function or filter is proposed for inequality constrained optimization. There is only two or three systems of linear equations with the same coefficients are solved at each iteration. We obtain a fundamental direction and the corresponding multiplier by the first equation, and then make full use of Lagrangian function information and multiplier to bend the search direction appropriately and obtain the search direction by the second linear equation. Moreover, the acceptable criterion of trial points is relaxed by the modified nonmonotone linear search technique. Under mild conditions, the global convergence of the algorithm is proved. Numerical results are given at the end of the paper.
WilsonR.B., A simplicial algorithm for concave programming, PhD thesis, Graduate School of Business Administration, Harvard University, 1963.
2.
HuangM.X. and PuD.G., A line search SQP method without a penality or a filter, Computational and Applied Mathematics34(2) (2015), 741–753.
3.
KostrevaM.M. and ChenX., A superlinearly convergent method of feasible directions, Applied Mathematics and Computation116(3) (2000), 231–244.
4.
JianJ.B., ZhengH.Y., HuQ.J. and TangC.M., A new normrelaxed method of strongly sub-feasible direction for inequality constrained optimization, Applied Mathematics and Computation168(1) (2005), 1–28.
5.
PanierE.R., TitsA.L. and HerskovitsJ.N., A QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization, SIAM Journal on Control and Optimization26(4) (1988), 788–811.
6.
QiH.D. and QiL.Q., A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization, SIAM Journal on Optimization11(1) (2000), 113–132.
7.
WangH., LiuF., GuC. and PuD.G., An infeasible activeset QP-free algorithm for general nonlinear programming, International Journal of Computer Mathematics94(5) (2017), 884–901.
8.
JianJ.B., ZengH.J., MaG.D. and ZhuZ.B., Primal-dual interior point QP-free algorithm for nonlinear constrained optimization, Journal of Inequalities and Applications239(1) (2017), 1–25.
9.
GaoZ.Y., HeG.P. and WuF., Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints, Journal of Optimization Theory and Applications95(2) (1997), 371–397.
10.
SasanB. and AndrĺęL.T., A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent, Comput Optim Appl25(1) (2003), 17–38.
11.
AndrĺęL.T., WachterA. and SasanA., A primal-dual interiorpoint method for nonlinear programming with strong global and local convergence properties, SIAM J Optim14(1) (2003), 173–199.
12.
ZhuZ., An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization, Appl Math Modelling31(6) (2007), 1201–1212.
13.
JianJ.B., HanD.L. and XuQ.J., A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization, Acta Mathematica Sinica26(12) (2010), 2399–2420.
14.
WangY., ChenL. and HeG., Sequential systems of linear equations method for general constrained optimization without strict complementarity, J Comput Appl Math182(2) (2004), 447–471.
15.
FletcherR. and LeyfferS., Nonlinear programming without a penalty function, Mathematical Programming91(2) (2002), 239–269.
16.
WchterA. and BieglerL.T., Line search filter methods for nonlinear: Global convergence, SIAM Journal on Optimization16(1) (2005), 32–48.
17.
ShenC.G., LeyfferS. and FletcherR., A nonmonotone filter method for nonlinear optimization, Computational Optimization and Applications52(3) (2012), 583–607.
18.
ZhouY. and PuD.G., A new QP-free feasible method for inequality constrained Optimization, Operations Research Transactions11(3) (2007), 31–43.
19.
LiuW.A., ShenC.G., ZhuX.J. and PuD.G., An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization, Optimization Methods and Software29(6) (2014), 1238–1260.
20.
DennisJ.E.Jr and SchnabelR.B., Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewoood Cliffs, NJ, 1983. Reprinted by SIAM Publications, 1993.
21.
LiJ.L. and YangZ.P., A QP-free algorithm without a penalty or a filter for nonlinear general-constrained optimization, Applied Mathematics and Computation316(1) (2018), 52–72.
22.
GrippoL., LamparielloF. and LudidiS., A nonmonotone line search technique for Newton’s method, SIAM Journal on Numerical Analysis23(4) (1986), 707–716.
23.
ShenC.G., XueW.J. and PuD.G., An infeasible nonmonotone SSLE algorithm for nonlinear programming, Journal of Mathmatical Metnod Operation Research71(1) (2010), 103–124.
24.
HockW. and SchittkowskiK., Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin Heidelberg New York, 1981.
