Netlib

The Netlib repository contains freely available software, documents, and databases of interest to the numerical, scientific computing, and other communities. The repository is maintained by AT&T Bell Laboratories, the University of Tennessee and Oak Ridge National Laboratory, and by colleagues world-wide. The collection is replicated at several sites around the world, automatically synchronized, to provide reliable and network efficient service to the global community.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 65 articles )

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

1 2 3 4 next

  1. Bueno, Luís Felipe; Haeser, Gabriel; Santos, Luiz-Rafael: Towards an efficient augmented Lagrangian method for convex quadratic programming (2020)
  2. Kheirfam, Behrouz; Haghighi, Masoumeh: A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps (2020)
  3. Asadi, S.; Mansouri, H.; Darvay, Zs.; Lesaja, G.; Zangiabadi, M.: A long-step feasible predictor-corrector interior-point algorithm for symmetric cone optimization (2019)
  4. Haddock, Jamie; Needell, Deanna: On Motzkin’s method for inconsistent linear systems (2019)
  5. Wang, Guoqiang; Yu, Bo: PAL-Hom method for QP and an application to LP (2019)
  6. Vu, Ky; Poirion, Pierre-Louis; Liberti, Leo: Random projections for linear programming (2018)
  7. Wang, Yang; Zhang, Ping: Two partial pricing strategies for the simplex algorithm (2018)
  8. Yang, Yaguang; Yamashita, Makoto: An arc-search (\mathcalO(nL)) infeasible-interior-point algorithm for linear programming (2018)
  9. Breedveld, Sebastiaan; van den Berg, Bas; Heijmen, Ben: An interior-point implementation developed and tuned for radiation therapy treatment planning (2017)
  10. Ketabchi, Saeed; Moosaei, Hossein; Parandegan, M.; Navidi, Hamidreza: Computing minimum norm solution of linear systems of equations by the generalized Newton method (2017)
  11. Khimich, A. N.; Popov, A. V.; Chistyakov, O. V.: Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices (2017)
  12. Yang, Ximei; Liu, Hongwei; Zhang, Yinkui: An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (2017)
  13. Yang, Yaguang: CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming (2017)
  14. Liberti, Leo; Poirion, Pierre-Louis; Ky, Vu Khac: Solving LP using random projections (2016)
  15. Towhidi, Mehdi; Orban, Dominique: Customizing the solution process of COIN-OR’s linear solvers with python (2016)
  16. Yang, Ximei; Zhang, Yinkui; Liu, Hongwei: A wide neighborhood infeasible-interior-point method with arc-search for linear programming (2016)
  17. Chernov, Alexey; von Petersdorff, Tobias; Schwab, Christoph: Quadrature algorithms for high dimensional singular integrands on simplices (2015)
  18. Ploskas, Nikolaos; Samaras, Nikolaos: A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit (2015)
  19. Boyana Norris, Sa-Lin Bernstein, Ramya Nair, Elizabeth Jessup: Lighthouse: A User-Centered Web Service for Linear Algebra Software (2014) arXiv
  20. Goerigk, Marc; Schöbel, Anita: Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (2014)

1 2 3 4 next