General Quadratic Programming

Abstract

An algorithm is presented for the general (not necessarily convex or concave) quadratic programming problem over a linearly constrained set. The algorithm is finitely convergent and makes use of a convex quadratic programming method as a subroutine (like the quadratic simplex for instance). The basic tool for this method is a facial decomposition for polyhedral sets.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1971
Accession Number
AD0740334

Entities

People

  • Claude-alain Burdet

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Bibliographies
  • Boundaries
  • Computations
  • Computer Programming
  • Computing-Related Activities
  • Construction
  • Decomposition
  • Efficiency
  • Integer Programming
  • Linear Systems
  • Military Research
  • Organizational Structure
  • Quadratic Programming
  • Schools
  • Simplex Method
  • Universities

Readers

  • Computer Science.
  • Graph Algorithms and Convex Optimization.