Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
type: Item
instance of: scholarly article
title: Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
zbMATH Open document ID: 0387.90084
DOI: 10.1007/BF00933376
author: R. W. Cottle
author: A. Djang
published in: Journal of Optimization Theory and Applications
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 3603028
zbMATH Keywords: ALGORITHMIC EQUIVALENCE
zbMATH Keywords: QUADRATIC PROGRAMMING
MaRDI profile type: Publication
cites work: Q4132018
cites work: Q5636698
cites work: The Symmetric Formulation of the Simplex Method for Quadratic Programming
cites work: Complementary pivot theory of mathematical programming
cites work: A Transformation of Which The Equation of Telegraphy is a Differential Invariant
cites work: Q5571406
cites work: Q5592809
cites work: Q3277015
cites work: A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
cites work: Q3844775
description: scientific article; zbMATH DE number 3603028