Pages that link to "Item:Q3903970"
From MaRDI portal
The following pages link to Family of algorithms for solving convex programming problems (Q3903970):
Displayed 12 items.
- Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts (Q608445) (← links)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
- Using two successive subgradients in the ellipsoid method for nonlinear programming (Q1337226) (← links)
- Method of simple-body centroids (Q1375256) (← links)
- Optimization of computations (Q1905130) (← links)
- General models in min-max continuous location: Theory and solution techniques (Q2564174) (← links)
- An ellipsoid algorithm for nonlinear programming (Q3040934) (← links)
- A class of rank-two ellipsoid algorithms for convex programming (Q3325476) (← links)
- Method of ellipsoids, its generalizations and applications (Q3677524) (← links)
- Method of obtaining estimates in quadratic extremal problems with Boolean variables (Q3724090) (← links)
- Convergence of a cyclic ellipsoid algorithm for systems of linear equalities (Q3931030) (← links)
- Investigation of optimization methods and their applications (Q3948819) (← links)