An inertia theorem for symmetric matrices and its application to nonlinear programming (Q1068908)

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 3931181
Language Label Description Also known as
default for all languages
No label defined
    English
    An inertia theorem for symmetric matrices and its application to nonlinear programming
    scientific article; zbMATH DE number 3931181

      Statements

      An inertia theorem for symmetric matrices and its application to nonlinear programming (English)
      0 references
      1985
      0 references
      The authors study a relationship between the inertia (i.e. the ordered triple of positive, negative, and zero eigenvalues) of a real symmetric matrix and the inertia of its restriction to a subspace. The result is then applied to the partitioned matrix \(A=(A_{ij})\) with \(A_{11}=H\), \(A_{12}=J^ T\), \(A_{21}=J\), \(A_{22}=0\), where H is the Hessian of the Lagrangian and J is the Jacobian of the constraints in nonlinear programming. It is shown that the inertia of such a matrix A depends only on the inertia of the projection of H onto the null-space of J. Hence it is possible to describe the Karush-Kuhn-Tucker points by the inertia of A rather than H.
      0 references
      optimal solution
      0 references
      inertia
      0 references
      real symmetric matrix
      0 references
      Hessian
      0 references
      Lagrangian
      0 references
      Jacobian
      0 references
      Karush-Kuhn-Tucker points
      0 references
      0 references
      0 references
      0 references

      Identifiers