A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization

Method of feasible directions (MFD) is an important method for solving nonlinearly constrained optimization. However, various types of MFD all need an initial feasible point, which can not be found easily in generally. In addition, the computational cost of some MFD with superlinearly convergent property is rather high. On the other hand, the strongly sub-feasible direction method does not need an initial feasible point, but most of the proposed algorithm do not have the superlinearly convergent property, and can not guarantee that the iteration point is feasible after finite iterations. In this paper, we present a new superlinearly convergent algorithm with arbitrary initial point. At each iteration, a master direction is obtained by solving one direction finding subproblem (DFS), and an auxiliary direction is yielded by an explicit formula. After finite iterations, the iteration point goes into the feasible set and the master direction is a feasible direction of descent. Since a new generalized projection technique is contained in the auxiliary direction formula, under some mild assumptions without the strict complementarity, the global convergence and superlinear convergence of the algorithm can be obtained.

[1]  David Q. Mayne,et al.  Combined phase I—phase II methods of feasible directions , 1979, Math. Program..

[2]  Craig T. Lawrence,et al.  A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm , 2000, SIAM J. Optim..

[3]  Z Gao.  A SQP FEASIBLE METHOD FOR NONLINEAR PROGRAMMING , 1995 .

[4]  E. Polak,et al.  Rate of Convergence of a Class of Methods of Feasible Directions , 1973 .

[5]  Michael M. Kostreva,et al.  A superlinearly convergent method of feasible directions , 2000, Appl. Math. Comput..

[6]  Xu Yifan,et al.  A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations , 2000 .

[7]  Kecun Zhang,et al.  A new SQP method of feasible directions for nonlinear programming , 2004, Appl. Math. Comput..

[8]  E. Panier,et al.  A superlinearly convergent feasible method for the solution of inequality constrained optimization problems , 1987 .

[9]  A. F. Veinott,et al.  On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming , 1967 .

[10]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[11]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[12]  G. Zoutendijk,et al.  Methods of Feasible Directions , 1962, The Mathematical Gazette.

[13]  J. Jinbao,et al.  A superlinearly and quadratically convergent SQP type feasible method for constrained optimization , 2000 .

[14]  Michael M. Kostreva,et al.  A generalization of the norm-relaxed method of feasible directions , 1999, Appl. Math. Comput..

[15]  André L. Tits,et al.  On combining feasibility, descent and superlinear convergence in inequality constrained optimization , 1993, Math. Program..

[16]  M. Kostreva,et al.  Norm-relaxed method of feasible directions for solving nonlinear programming problems , 1994 .

[17]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

[18]  Chun-Ming Tang,et al.  A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization , 2005, Appl. Math. Comput..

[19]  M. M. Kostreva,et al.  Global Convergence Analysis of Algorithms for Finding Feasible Points in Norm-Relaxed MFD , 1999 .