An Alternative Method for A Global Analysis of Quadratic Programs in a Finite Number of Steps.

Abstract

This paper considers the global analysis of general quadratic programs in a finite number of steps. A procedure is presented for recursively finding either the global minimum or a halfline of the constraint set along which the minimand is unbounded below. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1977
Accession Number
ADA049756

Entities

People

  • Andre F. Perold

Organizations

  • University of Washington

Tags

DTIC Thesaurus Topics

  • Algorithms
  • C Programming Language
  • Computer Programming
  • Contracts
  • Convex Sets
  • Evolutionary Algorithms
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • Nonconvex Programming
  • Operations Research
  • Optimization
  • Quadratic Programming
  • United States
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research