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.

References in zbMATH (referenced in 67 articles )

Showing results 1 to 20 of 67.
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. Cipolla, Stefano; Redivo-Zaglia, Michela; Tudisco, Francesco: Extrapolation methods for fixed-point multilinear PageRank computations. (2020)
  3. Kheirfam, Behrouz; Haghighi, Masoumeh: A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps (2020)
  4. Asadi, S.; Mansouri, H.; Darvay, Zs.; Lesaja, G.; Zangiabadi, M.: A long-step feasible predictor-corrector interior-point algorithm for symmetric cone optimization (2019)
  5. Golikov, A. I.; Evtushenko, Yu. G.; Kaporin, I. E.: Newton-type method for solving systems of linear equations and inequalities (2019)
  6. Haddock, Jamie; Needell, Deanna: On Motzkin’s method for inconsistent linear systems (2019)
  7. Wang, Guoqiang; Yu, Bo: PAL-Hom method for QP and an application to LP (2019)
  8. Vu, Ky; Poirion, Pierre-Louis; Liberti, Leo: Random projections for linear programming (2018)
  9. Wang, Yang; Zhang, Ping: Two partial pricing strategies for the simplex algorithm (2018)
  10. Yang, Yaguang; Yamashita, Makoto: An arc-search (\mathcalO(nL)) infeasible-interior-point algorithm for linear programming (2018)
  11. Breedveld, Sebastiaan; van den Berg, Bas; Heijmen, Ben: An interior-point implementation developed and tuned for radiation therapy treatment planning (2017)
  12. Ketabchi, Saeed; Moosaei, Hossein; Parandegan, M.; Navidi, Hamidreza: Computing minimum norm solution of linear systems of equations by the generalized Newton method (2017)
  13. Khimich, A. N.; Popov, A. V.; Chistyakov, O. V.: Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices (2017)
  14. 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)
  15. Yang, Yaguang: CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming (2017)
  16. Liberti, Leo; Poirion, Pierre-Louis; Ky, Vu Khac: Solving LP using random projections (2016)
  17. Towhidi, Mehdi; Orban, Dominique: Customizing the solution process of COIN-OR’s linear solvers with python (2016)
  18. Yang, Ximei; Zhang, Yinkui; Liu, Hongwei: A wide neighborhood infeasible-interior-point method with arc-search for linear programming (2016)
  19. Chernov, Alexey; von Petersdorff, Tobias; Schwab, Christoph: Quadrature algorithms for high dimensional singular integrands on simplices (2015)
  20. Ploskas, Nikolaos; Samaras, Nikolaos: A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit (2015)

1 2 3 4 next