Netlib

swMATH4368MaRDI QIDQ16545FDOQ16545

Author name not available (Why is that?)

Official website: http://www.netlib.org/liblist.html

Cited In (only showing first 100 items - show all)

• An affine scaling method using a class of differential barrier functions: primal approach
• galpv4
• NetBuild: transparent cross‐platform access to computational software libraries
• Numerical report of basic line algorithm for linear programming
• On Motzkin's method for inconsistent linear systems
• Newton-type method for solving systems of linear equations and inequalities
• PAL-Hom method for QP and an application to LP
• BenchmarkProfiles.jl
• Two partial pricing strategies for the simplex algorithm
• Linear programming computation
• Linear programming with nonparametric penalty programs and iterated thresholding
• Extrapolation methods for fixed‐point multilinear PageRank computations
• Spherical harmonic projectors
• The software library numeralgo
• Repository mirroring
• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
• Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices
• The computation of spectral density functions for singular Sturm-Liouville problems involving simple continuous spectra
• A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
• Computing minimum norm solution of linear systems of equations by the generalized Newton method
• Title not available (Why is that?)
• An Introduction to Numerical Analysis
• A weighted projection centering method
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
• Mathematical software: Past, present, and future
• Random projections for linear programming
• A comparison of some codes for the stiff oscillatory problem
• Title not available (Why is that?)
• Using agent-based software for scientific computing in the NetSolve system
• Nelder-Mead Simplex Modifications for Simulation Optimization
• Title not available (Why is that?)
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities
• Grapham: graphical models with adaptive random walk Metropolis algorithms
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• \texttt{smt}: A Matlab toolbox for structured matrices
• Algorithm 775
• On interior-point warmstarts for linear and combinatorial optimization
• Scaling linear optimization problems prior to application of the simplex method
• An affine-scaling pivot algorithm for linear programming
• Certifying feasibility and objective value of linear programs
• A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
• The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
• Iterated deferred correction for linear two-point boundary value problems
• SLEDGE
• Title not available (Why is that?)
• PyCOIN
• QSopt-Exact
• APNN-Toolbox
• Grapham
• DESI
• numeralgo
• smt
• toms729gw
• CAOP
• SIMPAR
• LinTim
• ROPI
• aicm
• NETLIB LP Test Set
• na15
• na31
• na9
• TOEPLITZ
• cantata
• GTOP
• Lighthouse
• The final NETLIB-LP results
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• CurveLP
• EPSfun
• SYNPLEX
• PyCPX
• PyLPSolve
• TROTS
• CyLP
• PESPLib
• CHFACT
• LPbook
• Lis
• glsim
• Towards an efficient augmented Lagrangian method for convex quadratic programming
• drsolve
• Quadrature algorithms for high dimensional singular integrands on simplices
• A benchmark library of mixed-integer optimal control problems
• The Price of Robustness
• An interior-point implementation developed and tuned for radiation therapy treatment planning
• Connection coefficients for orthogonal polynomials: Symbolic computations, verifications and demonstrations in the Mathematica language
• Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
• A practical guide to splines.
• A parallel implementation of the revised simplex algorithm using OpenMP: some preliminary results
• Curvature integrals and iteration complexities in SDP and symmetric cone programs
• Solving LP using random projections
• Computational experience with rigorous error bounds for the Netlib linear programming library
• Several modifications of simplex method
• Shohat-Favard and Chebyshev's methods in \(d\)-orthogonality
• Rational approximations, software and test methods for sine and cosine integrals
• Customizing the solution process of COIN-OR's linear solvers with python
• Numerical solution of eigenvalue problems for Hamiltonian systems

This page was built for software: Netlib