Pages that link to "Item:Q1824551"
From MaRDI portal
The following pages link to An implementation of Karmarkar's algorithm for linear programming (Q1824551):
Displayed 50 items.
- Splitting dense columns in sparse linear systems (Q803727) (← links)
- Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Interior point method for long-term generation scheduling of large-scale hydrothermal systems (Q839779) (← links)
- Fuzzy goal programming: complementary slackness conditions and computational schemes (Q849750) (← links)
- An adaptation of the dual-affine interior point method for the surface flatness problem (Q877663) (← links)
- Design of face-centred orthorhombic filter banks (Q878239) (← links)
- An extended variant of Karmarkar's interior point algorithm (Q879548) (← links)
- Cubically convergent method for locating a nearby vertex in linear programming (Q911456) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems (Q914546) (← links)
- On the generalized Wolf problem: preprocessing of nonnegative large-scale linear programming problems with group constraints (Q927521) (← links)
- Bilevel time minimizing transportation problem (Q955331) (← links)
- The \(\ell_1\) solution of linear inequalities (Q959132) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- SICOpt: Solution approach for nonlinear integer stochastic programming problems (Q1039361) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- Conical projection algorithms for linear programming (Q1117835) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- An interior point algorithm for semi-infinite linear programming (Q1123804) (← links)
- On finding a vertex solution using interior point methods (Q1174841) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- Interior point algorithms for linear programming with inequality constraints (Q1181732) (← links)
- Global convergence of the affine scaling methods for degenerate linear programming problems (Q1181905) (← links)
- Comparative analysis of affine scaling algorithms based on simplifying assumptions (Q1181906) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- On the complexity of following the central path of linear programs by linear extrapolation. II (Q1181914) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- On affine scaling and semi-infinite programming (Q1196188) (← links)
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (Q1205513) (← links)
- On combined phase 1-phase 2 projective methods for linear programming (Q1207329) (← links)
- A weighted least squares study of robustness in interior point linear programming (Q1260620) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- Computing Karmarkar's projections in stochastic linear programming (Q1288215) (← links)
- A parallel interior point algorithm for linear programming on a network of transputers (Q1309858) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- A simplified global convergence proof of the affine scaling algorithm (Q1312779) (← links)
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems (Q1312782) (← links)
- On the expected optimal value of random assignment problems: Experimental results and open questions (Q1315447) (← links)
- K-K-T multiplier estimates and objective function lower bounds from projective SUMT (Q1316100) (← links)
- Solving symmetric indefinite systems in an interior-point method for linear programming (Q1321659) (← links)
- On the big \({\mathcal M}\) in the affine scaling algorithm (Q1321664) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- On the number of iterations of Karmarkar's algorithm for linear programming (Q1321670) (← links)
- Interior dual proximal point algorithm for linear programs (Q1333478) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)