The following pages link to NETLIB LP Test Set (Q23426):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- A class of primal affine scaling algorithms (Q427024) (← links)
- How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
- Certifying feasibility and objective value of linear programs (Q453056) (← links)
- qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
- An infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning (Q539107) (← links)
- An interior point method for constrained saddle point problems (Q539681) (← links)
- Mathematical programming via the least-squares method (Q607446) (← links)
- A comparative study of redundant constraints identification methods in linear programming problems (Q624719) (← links)
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization (Q745223) (← links)
- Computing projections for the Karmarkar algorithm (Q806966) (← links)
- Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
- Improving the efficiency of the simplex algorithm based on a geometric explanation of phase 1 (Q840613) (← links)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← links)
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
- An efficient approach to updating simplex multipliers in the simplex algorithm (Q927163) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- A dual projective simplex method for linear programming (Q1129474) (← links)
- On finding a vertex solution using interior point methods (Q1174841) (← links)
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
- Steplengths in interior-point algorithms of quadratic programming (Q1306349) (← links)
- A parallel interior point algorithm for linear programming on a network of transputers (Q1309858) (← links)
- A strictly improving linear programming Phase I algorithm (Q1312775) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- Simulation and optimization by quantifier elimination (Q1368693) (← links)
- The long step rule in the bounded-variable dual simplex method: Numerical experiments (Q1397068) (← links)
- The final NETLIB-LP results (Q1417592) (← links)
- Robust solutions of linear programming problems contaminated with uncertain data (Q1587934) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
- Threshold incomplete factorization constraint preconditioners for saddle-point matrices (Q1743074) (← links)
- A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
- The inverse optimal value problem (Q1769073) (← links)
- A dual projective pivot algorithm for linear programming (Q1771222) (← links)
- Stabilization of Mehrotra's primal-dual algorithm and its implementation (Q1771347) (← links)
- Multiple centrality corrections in a primal-dual method for linear programming (Q1816400) (← links)
- Robust optimization-methodology and applications (Q1849501) (← links)
- Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter (Q1856363) (← links)
- Computational techniques of the simplex method (Q1860337) (← links)
- A simplified homogeneous and self-dual linear programming algorithm and its implementation (Q1915910) (← links)
- On the simplex algorithm initializing (Q1938217) (← links)
- An efficient algorithm for sparse null space basis problem using ABS methods (Q1944750) (← links)
