BPMPD is a state-of-the-art implementation of a primal-dual interior point algorithm, written in C programming language. Recent version is 2.21. You can find a performance comparison of differnent IPM packages (including BPMPD) on the pages of Decision Tree for Optimization Software. Press here to view the BPMPD readme file. There is a downloadable Windows95/NT executable and DLL version of the recent release

References in zbMATH (referenced in 40 articles )

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

1 2 next

  1. Ben Hermans, Andreas Themelis, Panagiotis Patrinos: QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs (2020) arXiv
  2. Castro, Jordi; González, José A.: A linear optimization-based method for data privacy in statistical tabular data (2019)
  3. Berthold, Timo; Perregaard, Michael; Mészáros, Csaba: Four good reasons to use an interior point solver within a MIP solver (2018)
  4. Gould, Nicholas I. M.; Robinson, Daniel P.: A dual gradient-projection method for large-scale strictly convex quadratic problems (2017)
  5. Meszaros, Csaba: The practical behavior of the homogeneous self-dual formulations in interior point methods (2015)
  6. Pan, Ping-Qi: Linear programming computation (2014)
  7. Mészáros, Csaba: On sparse matrix orderings in interior point methods (2013)
  8. Bougnol, Marie-Laure; Dulá, José H.; Rouse, Paul: Interior point methods in DEA to determine non-zero multiplier weights (2012)
  9. Mészáros, Csaba: Regularization techniques in interior point methods (2012)
  10. Mészáros, Csaba: Solving quadratically constrained convex optimization problems with an interior-point method (2011)
  11. Patrinos, Panagiotis; Sopasakis, Pantelis; Sarimveis, Haralambos: A global piecewise smooth Newton method for fast large-scale model predictive control (2011)
  12. Mészáros, Csaba: On the implementation of interior point methods for dual-core platforms (2010)
  13. Mészáros, Csaba: The Bpmpd interior point solver for convex quadratically constrained quadratic programming problems (2010)
  14. Kukreja, Sunil L.: Application of a least absolute shrinkage and selection operator to aeroelastic flight test data (2009)
  15. Fülöp, János: A method for approximating pairwise comparison matrices by consistent matrices (2008)
  16. Hu, Jian-Feng; Pan, Ping-Qi: An efficient approach to updating simplex multipliers in the simplex algorithm (2008)
  17. Koberstein, Achim: Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (2008)
  18. Mészáros, Csaba: On numerical issues of interior point methods (2008)
  19. Ormerod, John T.; Wand, M. P.; Koch, Inge: Penalized spline support vector classifiers computational issues (2008)
  20. Osorio, Maria A.; Gulpinar, Nalan; Rustem, Berc: A mixed integer programming model for multistage mean-variance post-tax optimization (2008)

1 2 next