PCx: an interior-point code for linear programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 89062
- scientific article; zbMATH DE number 432998
- scientific article; zbMATH DE number 434541
- Interior proximal point algorithm for linear programs
- An interior point method for linear programming
- scientific article; zbMATH DE number 4031392
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- scientific article; zbMATH DE number 123966
- A primal projective interior point method for linear programming
- scientific article; zbMATH DE number 409894
Cites work
- An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Modification of the minimum-degree algorithm by multiple elimination
- Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
- On the Automatic Scaling of Matrices for Gaussian Elimination
- On the Implementation of a Primal-Dual Interior Point Method
- The Role of Elimination Trees in Sparse Factorization
Cited in
(37)- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Improving the preconditioning of linear systems from interior point methods
- PCx
- Using groups in the splitting preconditioner computation for interior point methods
- 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
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- A finite termination Mehrotra-type predictor-corrector algorithm
- Optimized choice of parameters in interior-point methods for linear programming
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- 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
- The other side of ranking schemes: generating weights for specified outcomes
- Infeasible interior-point methods for linear optimization based on large neighborhood
- Mehrotra-type predictor-corrector algorithm revisited
- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
- CVXGEN: a code generator for embedded convex optimization
- Using the analytic center in the feasibility pump
- The BPMPD interior point solver for convex quadratic problems
- Computing the splitting preconditioner for interior point method using an incomplete factorization approach
- A Mehrotra type predictor-corrector interior-point method for \(P_\ast(\kappa)\)-HLCP
- Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number
- Computational experience with a modified potential reduction algorithm for linear programming
- 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
- Quadratic regularizations in an interior-point method for primal block-angular problems
- A note on matrix reordering for linear system solutions by iterative methods in interior point methods
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
- On squared-variable formulations
- A generalization of the weight reduction algorithm
- Polynomial time second order mehrotra-type predictor--corrector algorithms
This page was built for publication: PCx: an interior-point code for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4504787)
