A polynomial algorithm for the quadratic programming problem

DOI10.1515/RNAM-2014-0011zbMATH Open1297.90104OpenAlexW2331634011MaRDI QIDQ2016445FDOQ2016445

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

Recommendations

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

zbMATH Keywords

quadratic programmingprojectiondual problempointed conenondegenerate transformation

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of quadratic programming with two quadratic constraints
• Title not available (Why is that?)
• Quadratic programming is in NP
• Title not available (Why is that?)
• A quadratic programming algorithm
• Title not available (Why is that?)
• Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints

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)