Procedures for Optimization Problems with a Mixture of Bounds and General Linear Constraints.

Abstract

When describing active-set methods for linearly constrained optimization, it is often convenient to treat all constraints in a uniform manner. However, in many problems the linear constraints include simple bounds on the variables as well as general constraints. Special treatment of bound constraints in the implementation of an active-set method yields significant advantages in computational effort and storage requirements. In this paper, we describe how to perform the constraint-related steps of an active-set method when the constraint matrix is dense and bounds are treated separately. These steps involve updates to the TQ factorization of the working set of constraints and the Cholesky factorization of the projected Hessian (or Hessian approximation). (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1982
Accession Number
ADA115854

Entities

People

  • Margaret H. Wright
  • Michael Saunders
  • Philip Edward Gill
  • Walter Murray

Organizations

  • Stanford University

Tags

Communities of Interest

  • Air Platforms
  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Band Structures
  • Computations
  • Computer Programming
  • Computer Programs
  • Linear Algebra
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • New York
  • Nonlinear Programming
  • Numerical Analysis
  • Operations Research
  • Optimization
  • Quadratic Programming
  • Simplex Method
  • United States

Readers

  • Operations Research