Pages that link to "Item:Q1804355"
From MaRDI portal
The following pages link to A note on the strong polynomiality of convex quadratic programming (Q1804355):
Displaying 5 items.
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Non‐negative residual matrix factorization: problem definition, fast solutions, and applications (Q4969817) (← links)
- Strongly n-polynomial convexity and related inequalities (Q6061422) (← links)
- Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables (Q6161304) (← links)