Pages that link to "Item:Q3707772"
From MaRDI portal
The following pages link to Using deep cuts in an ellipsoid algorithm for nonlinear programming (Q3707772):
Displaying 7 items.
- A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming (Q1123811) (← links)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
- The ellipsoid algorithm using parallel cuts (Q1315450) (← links)
- Using two successive subgradients in the ellipsoid method for nonlinear programming (Q1337226) (← links)
- Active set strategies in an ellipsoid algorithm for nonlinear programming (Q1433159) (← links)
- Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method (Q2514448) (← links)
- General models in min-max continuous location: Theory and solution techniques (Q2564174) (← links)