Containing and shrinking ellipsoids in the path-following algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3677572 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Complementary pivot theory of mathematical programming
- Conical projection algorithms for linear programming
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Karmarkar's algorithm and the ellipsoid method
- Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming
- The Ellipsoid Method Generates Dual Variables
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
Cited in
(17)- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming
- Navigation of a quadratic potential with ellipsoidal obstacles
- Solving linear systems involved in constrained optimization
- On some efficient interior point methods for nonlinear convex programming
- Degeneracy in interior point methods for linear programming: A survey
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
- Karmarkar's algorithm and the ellipsoid method
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- On solution-containing ellipsoids in linear programming
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
- An optimal-basis identification technique for interior-point linear programming algorithms
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- Cubically convergent method for locating a nearby vertex in linear programming
- On the convergence of the method of analytic centers when applied to convex quadratic programs
- Ellipsoids containing optimal solutions of the linear programming problem
- A new potential reduction algorithm for smooth convex programming
This page was built for publication: Containing and shrinking ellipsoids in the path-following algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813834)
