A note on the strong polynomiality of convex quadratic programming

zbMath0834.90103MaRDI QIDQ1804355

Sung-Pil Hong, Sushil Verma

Publication date: 1 April 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

convex quadratic programstrongly polynomial timenearest point on a simplicial cone

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20)

Related Items (1)

Non‐negative residual matrix factorization: problem definition, fast solutions, and applications

This page was built for publication: A note on the strong polynomiality of convex quadratic programming