A note on the strong polynomiality of convex quadratic programming
From MaRDI portal
(Redirected from Publication:1804355)
Recommendations
- Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables
- scientific article; zbMATH DE number 1139465
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
- Strongly n-polynomial convexity and related inequalities
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities
- scientific article; zbMATH DE number 617915
- On quadratic and complete quadratic problems of convex programming
- A note on strongly convex and quasiconvex functions
- scientific article; zbMATH DE number 3945887
- scientific article; zbMATH DE number 1322751
Cited in
(8)- On the complexity of approximating a KKT point of quadratic programming
- scientific article; zbMATH DE number 4213759 (Why is no real title available?)
- scientific article; zbMATH DE number 1139465 (Why is no real title available?)
- Non‐negative residual matrix factorization: problem definition, fast solutions, and applications
- On Polyhedral Approximations of the Second-Order Cone
- Strongly n-polynomial convexity and related inequalities
- Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
This page was built for publication: A note on the strong polynomiality of convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804355)
