Algorithmic equivalence in quadratic programming. I. A least-distance programming problem

DOI10.1007/BF00933376zbMath0387.90084MaRDI QIDQ1250029

A. Djang, Richard W. Cottle

Publication date: 1979

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

ALGORITHMIC EQUIVALENCEQUADRATIC PROGRAMMING

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items

On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem, Some n by dn linear complementarity problems, Active constraints, indefinite quadratic test problems, and complexity, Equivalence of some quadratic programming algorithms, An equivalence between two algorithms for quadratic programming, Analysis and implementation of a dual algorithm for constrained optimization

Cites Work

• Complementary pivot theory of mathematical programming
• A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
• A Transformation of Which The Equation of Telegraphy is a Differential Invariant
• The Symmetric Formulation of the Simplex Method for Quadratic Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item