Netlib

swMATH4368MaRDI QIDQ16545FDOQ16545

Author name not available (Why is that?)

Cited In (67)

• An affine scaling method using a class of differential barrier functions: primal approach
• NetBuild: transparent cross‐platform access to computational software libraries
• Linear programming with nonparametric penalty programs and iterated thresholding
• Spherical harmonic projectors
• Repository mirroring
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Introduction to Numerical Analysis
• A weighted projection centering method
• Numerical report of basic line algorithm for linear programming
• On Motzkin's method for inconsistent linear systems
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
• Mathematical software: Past, present, and future
• Newton-type method for solving systems of linear equations and inequalities
• A comparison of some codes for the stiff oscillatory problem
• Title not available (Why is that?)
• PAL-Hom method for QP and an application to LP
• 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
• A Parallel Implementation of the Revised Simplex Algorithm Using OpenMP: Some Preliminary Results
• Algorithm 775
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Linear Programming Computation
• The final NETLIB-LP results
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• Extrapolation methods for fixed‐point multilinear PageRank computations
• Towards an efficient augmented Lagrangian method for convex quadratic programming
• A polynomial arc-search interior-point algorithm for linear programming
• The software library numeralgo
• On Interior-Point Warmstarts for Linear and Combinatorial Optimization
• Quadrature algorithms for high dimensional singular integrands on simplices
• 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.
• Random Projections for Linear Programming
• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
• Curvature integrals and iteration complexities in SDP and symmetric cone programs
• Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices
• Solving LP using random projections
• The computation of spectral density functions for singular Sturm-Liouville problems involving simple continuous spectra
• 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
• A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
• Customizing the solution process of COIN-OR's linear solvers with python
• Numerical solution of eigenvalue problems for Hamiltonian systems
• Decomposing Matrices into Blocks
• Computing minimum norm solution of linear systems of equations by the generalized Newton method
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for software: Netlib