The following pages link to Netlib (Q16545):
Displaying 50 items.
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (Q337170) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- Curvature integrals and iteration complexities in SDP and symmetric cone programs (Q404518) (← links)
- \texttt{smt}: A Matlab toolbox for structured matrices (Q411534) (← links)
- Certifying feasibility and objective value of linear programs (Q453056) (← links)
- Scaling linear optimization problems prior to application of the simplex method (Q453620) (← links)
- Solving LP using random projections (Q510927) (← links)
- A weighted projection centering method (Q539647) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Quadrature algorithms for high dimensional singular integrands on simplices (Q907587) (← links)
- Using agent-based software for scientific computing in the NetSolve system (Q1274742) (← links)
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities (Q1380442) (← links)
- The final NETLIB-LP results (Q1417592) (← links)
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
- An interior-point implementation developed and tuned for radiation therapy treatment planning (Q1687310) (← links)
- Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
- Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices (Q1699408) (← links)
- The software library numeralgo (Q1805936) (← links)
- Shohat-Favard and Chebyshev's methods in \(d\)-orthogonality (Q1805938) (← links)
- A comparison of some codes for the stiff oscillatory problem (Q1806566) (← links)
- Rational approximations, software and test methods for sine and cosine integrals (Q1815700) (← links)
- Mathematical software: Past, present, and future (Q1840889) (← links)
- Numerical solution of eigenvalue problems for Hamiltonian systems (Q1895906) (← links)
- The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form (Q1904151) (← links)
- Iterated deferred correction for linear two-point boundary value problems (Q1915480) (← links)
- On Motzkin's method for inconsistent linear systems (Q1999709) (← links)
- Towards an efficient augmented Lagrangian method for convex quadratic programming (Q2191789) (← links)
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps (Q2192573) (← links)
- Newton-type method for solving systems of linear equations and inequalities (Q2206388) (← links)
- Computing minimum norm solution of linear systems of equations by the generalized Newton method (Q2360228) (← links)
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136) (← links)
- Connection coefficients for orthogonal polynomials: Symbolic computations, verifications and demonstrations in the Mathematica language (Q2391883) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- Grapham: graphical models with adaptive random walk Metropolis algorithms (Q2445573) (← links)
- Computational experience with rigorous error bounds for the Netlib linear programming library (Q2503174) (← links)
- (Q2748241) (← links)
- An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
- Linear Programming Computation (Q2851339) (← links)
- (Q2897314) (← links)
- On Interior-Point Warmstarts for Linear and Combinatorial Optimization (Q3058509) (← links)
- (Q3125518) (← links)
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming (Q3614175) (← links)
- The Price of Robustness (Q3637409) (← links)
- (Q3840333) (← links)
- Algorithm 775 (Q4223460) (← links)
- Decomposing Matrices into Blocks (Q4229489) (← links)
- The computation of spectral density functions for singular Sturm-Liouville problems involving simple continuous spectra (Q4236189) (← links)
- Nelder-Mead Simplex Modifications for Simulation Optimization (Q4363701) (← links)
- Repository mirroring (Q4371584) (← links)
