A polynomial algorithm for the quadratic programming problem

DOI10.1515/RNAM-2014-0011MaRDI QIDQ2016445zbMATH OpenOpenAlexFDO

Authors Valentin A. Bereznev

Publication date 20 June 2014

Published in Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/rnam-2014-0011

zbMATH Keywords

dual problemnondegenerate transformationpointed coneprojectionquadratic programming

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4156204
• scientific article; zbMATH DE number 4197755
• scientific article; zbMATH DE number 4033492
• scientific article; zbMATH DE number 4201503
• An extension of Karmarkar's projective algorithm for convex quadratic programming

Cited in

(12)

• On the complexity of quadratic programming with two quadratic constraints
• Quadratic programming is in NP
• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 4141790 (Why is no real title available?)
• scientific article; zbMATH DE number 4156204 (Why is no real title available?)
• scientific article; zbMATH DE number 4033492 (Why is no real title available?)
• A quadratic programming algorithm
• scientific article; zbMATH DE number 1215253 (Why is no real title available?)
• scientific article; zbMATH DE number 1139465 (Why is no real title available?)
• scientific article; zbMATH DE number 4197755 (Why is no real title available?)
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm

This page was built for publication: A polynomial algorithm for the quadratic programming problem

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