Pages that link to "Item:Q808184"
From MaRDI portal
The following pages link to Computational experience with a primal-dual interior point method for linear programming (Q808184):
Displaying 50 items.
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- Regularization techniques in interior point methods (Q432801) (← links)
- Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
- Splitting dense columns in sparse linear systems (Q803727) (← links)
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming (Q808189) (← links)
- Applying the progressive hedging algorithm to stochastic generalized networks (Q811327) (← links)
- On finding a vertex solution using interior point methods (Q1174841) (← 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)
- A brief description of ALPO (Q1186950) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- A diagonal quadratic approximation method for large scale linear programs (Q1200793) (← links)
- On combined phase 1-phase 2 projective methods for linear programming (Q1207329) (← 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)
- Strategic financial risk management and operations research (Q1278574) (← links)
- Computing Karmarkar's projections in stochastic linear programming (Q1288215) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- The role of the augmented system in interior point methods (Q1296137) (← links)
- A parallel interior point algorithm for linear programming on a network of transputers (Q1309858) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- On the expected optimal value of random assignment problems: Experimental results and open questions (Q1315447) (← links)
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited (Q1321176) (← links)
- Sensitivity method for basis inverse representation in multistage stochastic linear programming problems (Q1321212) (← links)
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems (Q1321337) (← 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)
- Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming (Q1338138) (← links)
- Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070) (← links)
- Recovering an optimal LP basis from an interior point solution (Q1342078) (← links)
- A predictor-corrector infeasible-interior-point algorithm for linear programming (Q1342276) (← links)
- Asymptotic convergence in a generalized predictor-corrector method (Q1352296) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization (Q1363416) (← links)
- Linear programming with stochastic elements: An on-line approach (Q1368447) (← links)
- Higher-order derivatives in linear and quadratic programming (Q1592581) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Parallel interior-point method for linear and quadratic programs with special structure (Q1608140) (← links)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- Symmetric indefinite systems for interior point methods (Q1803613) (← links)
- Exploiting special structure in a primal-dual path-following algorithm (Q1803615) (← links)
- Efficient solution of two-stage stochastic linear programs using interior point methods (Q1803648) (← links)
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points (Q1804652) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
