Convergence of the BFGS-SQP Method for Degenerate Problems

REFERENCES

• P.T. Boggs , J.W. Tolle , and P. Wang ( 1982 ). On the local convergence of quasi-Newton methods for constrained optimization . SIAM J. Control Optim. 20 : 161 – 171 .
   Web of Science ®Google Scholar
• G. Broyden , J. Dennis , and J. Moré ( 1973 ). On the local and superlinear convergence of quasi-Newton methods . J. Inst. Math. Appl. 12 : 223 – 246 .
   Google Scholar
• R.H. Byrd and J. Nocedal ( 1991 ). An analysis of reduced Hessian methods for constrained optimization . Math. Programming 49 : 285 – 323 .
   Web of Science ®Google Scholar
• R.H. Byrd and J. Nocedal ( 1989 ). A tool for the analysis of quasi-Newton methods with application to unconstrained minimization . SIAM J. Numer. Anal. 26 : 727 – 739 .
   Web of Science ®Google Scholar
• X.J. Chen ( 1996 ). Convergence of the BFGS method for LC 1 convex constrained optimization . SIAM J. Control Optim. 34 : 2051 – 2063 .
   Web of Science ®Google Scholar
• J. Dennis and J. Moré ( 1974 ). A characterization of superlinear convergence and its application to quasi-Newton Methods . Math. Comp. 28 : 549 – 560 .
   Web of Science ®Google Scholar
• J.F.A. De , O. Pantoja , and D.Q. Mayne ( 1991 ). Exact penalty function algorithm with simple updating of the penalty parameter . J. Optim. Theory Appl. 69 : 441 – 467 .
   Web of Science ®Google Scholar
• M. Fukushima ( 1986 ). A successive quadratic programming algorithm with global and superlinear convergence properties . Math. Programming 35 : 253 – 264 .
   Web of Science ®Google Scholar
• J. Gauvin ( 1977 ). A necessary and sufficient regularity condition to have a bounded multipliers in nonconvex programming . Math. Programming 12 : 136 – 138 .
   Web of Science ®Google Scholar
• W. Hock and K. Schittkowski ( 1981 ). Test examples for nonlinear programming codes . Lecture Notes in Economics and Mathematical Systems . ( M. Beckmann and H.P. Künze , eds.), Springer-Verlag , New York .
   Google Scholar
• D.H. Li and L.Q. Qi ( 2000 ). A Stabilized SQP Method via Linear Equations. Technical Report, Department of Applied Mathematics, School of Mathematics , New South Wales University , Sydney , Australia .
   Google Scholar
• D.H. Li and M. Fukushima ( 2001 ). On the global convergence of the BFGS method for nonconvex unconstrained problems . SIAM J. Optim. 11 : 1054 – 1064 .
   Web of Science ®Google Scholar
• D.Q. Mayne and E. Plolak ( 1982 ). A superlinear convergent algorithm for constrained optimization problems . Math. Programming Study 16 : 431 – 441 .
   Web of Science ®Google Scholar
• M.J.D. Powell and Y. Yuan ( 1986 ). A recursive quadratic programming algorithm that uses differentiable exact penalty functions . Math. Programming 35 : 265 – 278 .
   Web of Science ®Google Scholar
• S.J. Wright ( 1998 ). Superlinear convergence of a stabilized SQP method to degenerate solution . Computat. Optim. Appl. 11 : 253 – 275 .
   Web of Science ®Google Scholar
• S.J. Wright ( 2002 ). Modifying SQP for degenerate problems . SIAM J. Optim. 13 : 470 – 497 .
   Web of Science ®Google Scholar
• Y.F. Xie and R.H. Byrd ( 1999 ). Practical update criteria for reduced Hessian SQP: global analysis . SIAM J. Optim. 9 : 578 – 604 .
   Web of Science ®Google Scholar
• Y.X. Yuan and W.Y. Sun ( 2001 ). Optimization Theories and Methods. Chinese Scientific Publishers , Beijing ( in Chinese ).
   Google Scholar
• J.L. Zhang and X.S. Zhang ( 2002 ). A SQP method for inequality constrained optimization . Acta Math. Appl. Sinica, English Series 18 : 77 – 84 .
   Google Scholar