An equivalence between two algorithms for quadratic programming

DOI10.1007/BF01589342zbMath0448.90043OpenAlexW2019218110MaRDI QIDQ3895232

Jong-Shi Pang

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01589342

zbMATH Keywords

column generationsimplicial decompositionequivalence of algorithms

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (2)

A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming ⋮ Equivalence of some quadratic programming algorithms

Cites Work

• Unnamed Item
• Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
• A decomposition algorithm for quadratic programming
• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• Simplicial decomposition in nonlinear programming algorithms
• Methods for Modifying Matrix Factorizations
• The Symmetric Formulation of the Simplex Method for Quadratic Programming

This page was built for publication: An equivalence between two algorithms for quadratic programming