Pages that link to "Item:Q3934131"
From MaRDI portal
The following pages link to Modifications and implementation of the ellipsoid algorithm for linear programming (Q3934131):
Displayed 10 items.
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
- Objective functions and the complexity of policy design (Q1097156) (← links)
- The ellipsoid method in linear programming (Q1157277) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Simplices by point-sliding and the Yamnitsky-Levin algorithm (Q1366323) (← links)
- A class of methods for solving large convex systems (Q1813379) (← links)
- The ellipsoid method and its implications (Q1835842) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- An ellipsoid algorithm for nonlinear programming (Q3040934) (← links)
- A class of rank-two ellipsoid algorithms for convex programming (Q3325476) (← links)