A successive quadratic programming algorithm with global and superlinear convergence properties (Q3731379)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3963583
Language Label Description Also known as
default for all languages
No label defined
    English
    A successive quadratic programming algorithm with global and superlinear convergence properties
    scientific article; zbMATH DE number 3963583

      Statements

      A successive quadratic programming algorithm with global and superlinear convergence properties (English)
      0 references
      0 references
      1986
      0 references
      successive quadratic programming
      0 references
      superlinear convergence
      0 references
      twice continuously differentiable
      0 references
      direction-finding subproblems
      0 references
      second-order approximation
      0 references
      Maratos effect
      0 references
      nonsmooth exact penalty function
      0 references
      Kuhn- Tucker point
      0 references
      The author suggests an algorithm for solving the nonlinear programming problem (NPL): Minimize f(x) subject to \(c_ i(x)\leq 0\) \((i=1,...,m')\), \(c_ i(x)=0\), \((i=m'+1,...,m)\) where the functions f, \(c_ i\) are twice continuously differentiable. In order to ensure a fast ultimate convergence, direction-finding subproblems are derived from the second- order approximation to (NLP) which in itself is not tractable and is modified to a quadratic programming problem. The author claims that this modification has the added advantage of avoiding the Maratos effect, a phenomenon where the use of a nonsmooth exact penalty function results in the deterioration of the desirable local convergence property. Such devices have been incorporated in algorithms for ensuring global and superlinear convergence properties by various authors including \textit{T. F. Coleman} and \textit{A. R. Conn} [Math. Program. 24, 123-136, 137-161 (1982; Zbl 0501.90077, Zbl 0501.90078)] and \textit{R. M. Chamberlin, M. J. D. Powell, C. Lemarechal} and \textit{H. C. Pedersen} [Math. Program. Study 16, 1-17 (1982; Zbl 0501.90078)]. The algorithm suggested for solving (NLP) either terminates at a Kuhn-Tucker point of (NLP) or generates an infinite sequence \(\{\) \(x\}\) whose limit points are Kuhn-Tucker points of (NLP). Under suitable assumptions, it is shown that the sequence \(\{\) \(x\}\) generated by the algorithm converges superlinearly.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references