Pages that link to "Item:Q4180171"
From MaRDI portal
The following pages link to Dualität und Approximation bei konvexen Optimierungsproblemen (Q4180171):
Displayed 3 items.
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582) (← links)
- Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems (Q1078076) (← links)
- Easy transportation-like problems on K-dimensional arrays (Q1823138) (← links)