Pages that link to "Item:Q581231"
From MaRDI portal
The following pages link to A modification of Karmarkar's linear programming algorithm (Q581231):
Displaying 50 items.
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- Shape-preserving univariate cubic and higher-degree \(L_{1}\) splines with function-value-based and multistep minimization principles (Q625148) (← links)
- Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties (Q631064) (← links)
- Dual interior point algorithms (Q647858) (← links)
- Two-thirds is sharp for affine scaling (Q688206) (← links)
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions (Q688916) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- An interior multiobjective linear programming algorithm (Q690014) (← links)
- \(C^1\) and \(C^2\)-continuous polynomial parametric \(L_p\) splines (\(p\geq 1\)) (Q733434) (← links)
- Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm (Q750203) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines (Q869526) (← links)
- Cubically convergent method for locating a nearby vertex in linear programming (Q911456) (← links)
- Asymptotic behaviour of Karmarkar's method for linear programming (Q911987) (← links)
- Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems (Q914546) (← links)
- The \(\ell_1\) solution of linear inequalities (Q959132) (← links)
- Introduction: New approaches to linear programming (Q1088596) (← links)
- Computational experience with a dual affine variant of Karmarkar's method for linear programming (Q1092808) (← links)
- Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- Linear programming and the Newton barrier flow (Q1111465) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792) (← links)
- An interior point algorithm for semi-infinite linear programming (Q1123804) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- Karmarkar's linear programming algorithm and Newton's method (Q1176568) (← links)
- A primal projective interior point method for linear programming (Q1176804) (← links)
- A hybrid method for the nonlinear least squares problem with simple bounds (Q1177199) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← 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)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- Prior reduced fill-in in solving equations in interior point algorithms (Q1197902) (← links)
- Projection algorithms for linear programming (Q1199509) (← links)
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems (Q1199751) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- A weighted least squares study of robustness in interior point linear programming (Q1260620) (← links)
- Using aspiration levels in an interactive interior multiobjective linear programming algorithm (Q1266671) (← links)
- Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm (Q1266672) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- Affine scaling algorithm fails for semidefinite programming (Q1290670) (← links)
