PCx: an interior-point code for linear programming
From MaRDI portal
Publication:4504787
DOI10.1080/10556789908805757zbMath0970.90118OpenAlexW2013945499MaRDI QIDQ4504787
No author found.
Publication date: 14 September 2000
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789908805757
Linear programming (90C05) Interior-point methods (90C51) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP, Infeasible interior-point methods for linear optimization based on large neighborhood, Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number, A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming, A finite termination Mehrotra-type predictor-corrector algorithm, Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming, Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods, Improving the preconditioning of linear systems from interior point methods, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Polynomial time second order mehrotra-type predictor--corrector algorithms, A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization, Optimized choice of parameters in interior-point methods for linear programming, Using the analytic center in the feasibility pump, Quadratic regularizations in an interior-point method for primal block-angular problems, Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming, Mehrotra-type predictor-corrector algorithm revisited, Using groups in the splitting preconditioner computation for interior point methods, Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods, Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method, A variation on the interior point method for linear programming using the continued iteration, Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming, Interior point methods in DEA to determine non-zero multiplier weights, A new class of preconditioners for large-scale linear systems from interior point methods for linear programming, A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods, A Mehrotra type predictor-corrector interior-point algorithm for linear programming, Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach, Computational experience with a modified potential reduction algorithm for linear programming, The other side of ranking schemes: generating weights for specified outcomes, PCx, Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension, On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, The BPMPD interior point solver for convex quadratic problems
Uses Software
Cites Work
- Unnamed Item
- The Role of Elimination Trees in Sparse Factorization
- Modification of the minimum-degree algorithm by multiple elimination
- On the Implementation of a Primal-Dual Interior Point Method
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
- Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
- On the Automatic Scaling of Matrices for Gaussian Elimination
