Pages that link to "Item:Q1315434"
From MaRDI portal
The following pages link to A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434):
Displaying 10 items.
- Quasi-maximum likelihood estimation for conditional quantiles (Q265018) (← links)
- Computational geometry of positive definiteness (Q445814) (← links)
- Simplices by point-sliding and the Yamnitsky-Levin algorithm (Q1366323) (← links)
- Dominating sets for convex functions with some applications (Q1389077) (← links)
- An improved ellipsoid method for solving convex differentiable optimization problems (Q1939709) (← links)
- An entire space polynomial-time algorithm for linear programming (Q2442633) (← 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)
- Using deep cuts in an ellipsoid algorithm for nonlinear programming (Q3707772) (← links)
- Algorithm 825 (Q5461063) (← links)