Pages that link to "Item:Q1813834"
From MaRDI portal
The following pages link to Containing and shrinking ellipsoids in the path-following algorithm (Q1813834):
Displaying 13 items.
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs (Q583119) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Cubically convergent method for locating a nearby vertex in linear programming (Q911456) (← links)
- On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- On solution-containing ellipsoids in linear programming (Q1321453) (← links)
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming (Q1591595) (← links)
- Solving linear systems involved in constrained optimization (Q1902118) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- On the convergence of the method of analytic centers when applied to convex quadratic programs (Q2277366) (← links)
