An equivalence between two algorithms for quadratic programming

DOI10.1007/BF01589342zbMATH Open0448.90043OpenAlexW2019218110MaRDI QIDQ3895232FDOQ3895232

Authors: 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)

Cites Work

• A decomposition algorithm for quadratic programming
• Methods for Modifying Matrix Factorizations
• Simplicial decomposition in nonlinear programming algorithms
• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• The Symmetric Formulation of the Simplex Method for Quadratic Programming
• Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
• Title not available (Why is that?)

Cited In (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

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

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