An Equivalence between Two Algorithms for Quadratic Programming.

Abstract

In this paper, we demonstrate that the Van de Panne-Whinston symmetric simplex method when applied to a certain implicit formulation of a quadratic program generates the same sequence of primal feasible vectors as does the Von Hohenbalken simplicial decomposition algorithmsm specialized to the same program. Such an equivalence of the two algorithms extends earlier results for a least-distance program due to Cottle-Djang. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1979
Accession Number
ADA079815

Entities

People

  • Jong-shi Pang

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • Computations
  • Computer Programming
  • Decomposition
  • Demographic Cohorts
  • Equations
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Quadratic Programming
  • Sequences
  • Simplex Method
  • Standards
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research