PCx: An interior-point code for linear programming We describe the code PCx, a primal-dual interior-point code for linear programming. Information is given about problem formulation and the underlying algorithm, along with instructions for installing, invoking, and using the code. Computational results on standard test problems are reported.

References in zbMATH (referenced in 34 articles , 1 standard article )

Showing results 1 to 20 of 34.
Sorted by year (citations)

1 2 next

  1. Yang, Yaguang: CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming (2017)
  2. Asadi, Alireza; Roos, Cornelis: Infeasible interior-point methods for linear optimization based on large neighborhood (2016)
  3. Bougnol, Marie-Laure; Dulá, José H.; Rouse, Paul: Interior point methods in DEA to determine non-zero multiplier weights (2012)
  4. Friedlander, M.P.; Orban, D.: A primal-dual regularized interior-point method for convex quadratic programs (2012)
  5. Ghidini, Carla T.L.S.; Oliveira, A.R.L.; Silva, Jair.; Velazco, M.I.: Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods (2012)
  6. Mehrotra, Sanjay; Huang, Kuo-Ling: Computational experience with a modified potential reduction algorithm for linear programming (2012)
  7. Petra, Cosmin G.; Anitescu, Mihai: A preconditioning technique for Schur complement systems arising in stochastic optimization (2012)
  8. Zhang, Mingwang: A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization (2012)
  9. Baena, Daniel; Castro, Jordi: Using the analytic center in the feasibility pump (2011)
  10. Castro, Jordi; Cuesta, Jordi: Quadratic regularizations in an interior-point method for primal block-angular problems (2011)
  11. Velazco, M.I.; Oliveira, A.R.L.; Campos, F.F.: A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods (2010)
  12. Pietrabissa, Antonio: Optimal call admission and call dropping control in links with variable capacity (2009)
  13. Colombo, Marco; Gondzio, Jacek: Further development of multiple centrality correctors for interior point methods (2008)
  14. John, Elizabeth; Yıldırım, E.Alper: Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (2008)
  15. Bocanegra, S.; Campos, F.F.; Oliveira, A.R.L.: Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (2007)
  16. Cafieri, S.; D’apuzzo, M.; De Simone, V.; di Serafino, D.: On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (2007)
  17. Chai, Joo-Siong; Toh, Kim-Chuan: Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming (2007)
  18. Herrero, José R.; Navarro, Juan J.: Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (2007)
  19. Salahi, Maziar: A finite termination Mehrotra-type predictor-corrector algorithm (2007)
  20. Salahi, Maziar; Mahdavi-Amiri, Nezam: Polynomial time second order mehrotra-type predictor--corrector algorithms (2006)

1 2 next