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

DOI10.1007/BF00933376MaRDI QIDQ1250029zbMATH OpenFDO

Authors R. W. Cottle, A. Djang

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)

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3561096 (Why is no real title available?)
• scientific article; zbMATH DE number 3288282 (Why is no real title available?)
• scientific article; zbMATH DE number 3312380 (Why is no real title available?)
• scientific article; zbMATH DE number 3363351 (Why is no real title available?)
• 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
• Complementary pivot theory of mathematical programming
• The Symmetric Formulation of the Simplex Method for Quadratic Programming

Cited in

(6)

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

This page was built for publication: Algorithmic equivalence in quadratic programming. I. A least-distance programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250029)