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):
Displaying 15 items.
- Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts (Q608445) (← links)
- 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)
- Kan extensions are partial colimits (Q2156417) (← links)
- A probabilistic ellipsoid algorithm for linear optimization problems with uncertain LMI constraints (Q2342779) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method (Q2514448) (← links)
- An ellipsoid algorithm for nonlinear programming (Q3040934) (← links)
- A class of rank-two ellipsoid algorithms for convex programming (Q3325476) (← links)
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes (Q3452552) (← links)
