Skip to main content
Log in

Constrained definite Hessians tend to be well conditioned

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

Abstract

The testing of optimization algorithms requires the running of problems with ill-conditioned Hessians. For constrained problems, it is the projection of the Hessian onto the space determined by the active constraints that must be ill conditioned. In this note it is argued that unless the Hessian and the constraints are constructed together, the constrained Hessian is likely to be well conditioned. The approach is to examine the effects of random constraints on a singular Hessian.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. P.R. Halmos,Measure theory (Van Nostrand, Princeton, NJ, 1950).

    Google Scholar 

  2. A.S. Householder,The theory of matrices in numerical analysis (Blaisdell, New York, 1964).

    Google Scholar 

  3. G.W. Stewart, “The efficient generation of random orthogonal matrices with an application to condition estimators”,SIAM Journal on Numerical Analysis 17 (1980) 403–409.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported in part by the Office of Naval Research under Contract No. N00014-76-C-0391.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stewart, G.W. Constrained definite Hessians tend to be well conditioned. Mathematical Programming 21, 235–238 (1981). https://doi.org/10.1007/BF01584245

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01584245

Key words

Navigation