A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite

Certain matrix relationships play an important role in optimality conditions and algorithms for nonlinear and semidefinite programming. Let H be an n × n symmetric matrix, A an m × n matrix, and Z a basis for the null space of A. (In a typical optimization context, H is the Hessian of a smooth function and A is the Jacobian of a set of constraints.) When the reduced Hessian ZTHZ is positive definite, augmented Lagrangian methods rely on the known existence of a finite $\bar\rho\ge 0$ such that, for all $\rho > \bar\rho$, the augmented Hessian $H + \rho \ATA $ is positive definite. In this note we analyze the case when ZTHZ is positive semidefinite, i.e., singularity is allowed, and show that the situation is more complicated. In particular, we give a simple necessary and sufficient condition for the existence of a finite $\bar\rho$ so that $H + \rho \ATA$ is positive semidefinite for $\rho \ge \bar\rho$. A corollary of our result is that if H is nonsingular and indefinite while ZTHZ is positive semidefinite and singular, no such $\bar\rho$ exists.

[1]  Paul Pinsler Über das Vorkommen definiter und semidefiniter Formen in Scharen quadratischer Formen , 1936 .

[2]  M. Powell A method for nonlinear constraints in minimization problems , 1969 .

[3]  M. Hestenes Multiplier and gradient methods , 1969 .

[4]  A. Albert Conditions for Positive and Nonnegative Definiteness in Terms of Pseudoinverses , 1969 .

[5]  R. Cottle Manifestations of the Schur complement , 1974 .

[6]  T. Markham,et al.  A Generalization of the Schur Complement by Means of the Moore–Penrose Inverse , 1974 .

[7]  Philip E. Gill,et al.  Practical optimization , 1981 .

[8]  J. Crouzeix,et al.  Definiteness and semidefiniteness of quadratic forms revisited , 1984 .

[9]  Nicholas I. M. Gould,et al.  On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem , 1985, Math. Program..

[10]  J. Maddocks Errata: Restricted Quadratic Forms and Their Application to Bifurcation and Stability in Constrained Variational Principles , 1985 .

[11]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[12]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[13]  S. Nash,et al.  Linear and Nonlinear Programming , 1987 .

[14]  R. Fletcher Practical Methods of Optimization , 1988 .

[15]  J. Maddocks Restricted quadratic forms, inertia theorems, and the Schur complement , 1988 .

[16]  Jacques A. Ferland,et al.  Generalized convexity on affine subspaces with an application to potential functions , 1992, Math. Program..

[17]  J. Maddocks,et al.  On the stability of KdV multi‐solitons , 1993 .

[18]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[19]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[20]  Kurt M. Anstreicher,et al.  Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem , 2000, SIAM J. Optim..