Pages that link to "Item:Q3030578"
From MaRDI portal
The following pages link to A variation on Karmarkar’s algorithm for solving linear programming problems (Q3030578):
Displaying 50 items.
- Solving linear program as linear system in polynomial time (Q552124) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- Dual interior point algorithms (Q647858) (← 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)
- Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm (Q750203) (← links)
- On the asymptotic behavior of the projective rescaling algorithm for linear programming (Q750290) (← links)
- Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach (Q779763) (← 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)
- Cubically convergent method for locating a nearby vertex in linear programming (Q911456) (← links)
- Asymptotic behaviour of Karmarkar's method for linear programming (Q911987) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era (Q928099) (← links)
- The \(\ell_1\) solution of linear inequalities (Q959132) (← 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)
- 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)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← 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)
- Improving the rate of convergence of interior point methods for linear programming (Q1181911) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← 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)
- Todd's low-complexity algorithm is a predictor-corrector path-following method (Q1197903) (← links)
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems (Q1199751) (← links)
- Strict monotonicity in Todd's low-complexity algorithm for linear programming (Q1200765) (← 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)
- Affine scaling algorithm fails for semidefinite programming (Q1290670) (← links)
- Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
- Selected bibliography on degeneracy (Q1312748) (← 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 solution-containing ellipsoids in linear programming (Q1321453) (← links)
