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 37 items.
- A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
- A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
- A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
- Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case (Q1372556) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- Piecewise linear programming via interior points (Q1582686) (← links)
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
- Symmetric indefinite systems for interior point methods (Q1803613) (← links)
- Efficient solution of two-stage stochastic linear programs using interior point methods (Q1803648) (← links)
- Affine-scaling for linear programs with free variables (Q1812553) (← links)
- Computing Karmarkar's projections quickly by using matrix factorization (Q1815744) (← links)
- Limit analysis with the dual affine scaling algorithm (Q1899983) (← links)
- Presolving in linear programming (Q1914076) (← links)
- A simple proof of a primal affine scaling method (Q1915916) (← links)
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption (Q1915917) (← links)
- The primal power affine scaling method (Q1915919) (← links)
- An interior point method for general large-scale quadratic programming problems (Q1915920) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
- Superlinear convergence of the affine scaling algorithm (Q2365345) (← links)
- A weighted-gradient approach to multi-objective linear programming problems using the analytic hierarchy process (Q2365530) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- An analytical approach to the inference of summary data of additive type (Q2456376) (← links)
- Dual versus primal-dual interior-point methods for linear and conic programming (Q2467157) (← links)
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems (Q2640436) (← links)
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
- Loss and retention of accuracy in affine scaling methods (Q2778681) (← links)
- Interior-point methods for linear programming: a review (Q3150491) (← links)
- Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points (Q3835629) (← links)
- Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema (Q3835654) (← links)
- Implementing cholesky factorization for interior point methods of linear programming (Q3835659) (← links)
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem (Q4266399) (← links)
- Splitting dense columns of constraint matrix in interior point methods for large scale linear programming<sup>1</sup><sup>1</sup>The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Pl (Q4327921) (← links)
- A Primal-dual affine scaling algorithm with necessary centering as a safeguard (Q4351192) (← links)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
- An interior-point approach for solving MC\(^2\) linear programming problems (Q5943367) (← links)
- An efficient search direction for linear programming problems (Q5955478) (← links)