Constrained Definite Hessians Tend to be Well Conditioned.

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. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1980
Accession Number
ADA094257

Entities

People

  • Gilbert W. Stewart

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Computers
  • Eigenvalues
  • Eigenvectors
  • Matrix Theory
  • Military Research
  • Optimization
  • Physical Sciences
  • Random Variables
  • Standards
  • Theorems

Readers

  • Approximation Theory.
  • Artificial Intelligence
  • Linear Algebra

Technology Areas

  • Space