Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- 174 Downloads
Usual global convergence results for sequential quadratic programming (SQP) algorithms with linesearch rely on some a priori assumptions about the generated sequences, such as boundedness of the primal sequence and/or of the dual sequence and/or of the sequence of values of a penalty function used in the linesearch procedure. Different convergence statements use different combinations of assumptions, but they all assume boundedness of at least one of the sequences mentioned above. In the given context boundedness assumptions are particularly undesirable, because even for non-pathological and well-behaved problems the associated penalty functions (whose descent is used to produce primal iterates) may not be bounded below for any value of the penalty parameter. Consequently, boundedness assumptions on the iterates are not easily justifiable. By introducing a very simple and computationally cheap safeguard in the linesearch procedure, we prove boundedness of the primal sequence in the case when the feasible set is nonempty, convex, and bounded. If, in addition, the Slater condition holds, we obtain a complete global convergence result without any a priori assumptions on the iterative sequences. The safeguard consists of not accepting a further increase of constraints violation at iterates which are infeasible beyond a chosen threshold, which can always be ensured by the proposed modified SQP linesearch criterion.
KeywordsSequential quadratic programming Global convergence Nonsmooth penalty function Linesearch Slater condition
Mathematics Subject Classification (2000)90C30 65K05
Unable to display preview. Download preview PDF.
- 9.Powell M. (1978). The convergence of variable metric methods for nonlinearly constrained optimization calculations. In: Mangasarian, O., Meyer, R. and Robinson, S. (eds) Nonlinear Programming, pp 27–63. Academic, London Google Scholar
- 12.Wilson, R.B.: A simplicial method for concave programming. Ph.D. thesis, Graduate School of Business Administration, Harvard University, Cambridge (1963)Google Scholar