Computer experiments on quadratic programming algorithms
From MaRDI portal
Cites work
- A comparison of the primal‐simplex and complementary pivot methods for linear programming
- A Comparison of Two Methods for Quadratic Programming
- A Computer Comparison of Four Quadratic Programming Algorithms
- A critical review of comparisons of mathematical programming algorithms and software (1953-1977)
- A quadratic programming algorithm using conjugate search directions
- Bimatrix Equilibrium Points and Mathematical Programming
- scientific article; zbMATH DE number 3423499 (Why is no real title available?)
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3532701 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 3602994 (Why is no real title available?)
- scientific article; zbMATH DE number 3224200 (Why is no real title available?)
- scientific article; zbMATH DE number 3301979 (Why is no real title available?)
- scientific article; zbMATH DE number 3308855 (Why is no real title available?)
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Reporting computational experiments in mathematical programming
- Some Programming Problems in Population Projection
- The Convex Simplex Method
- The Simplex Method for Quadratic Programming
- Two-person nonzero-sum games and quadratic programming
Cited in
(6)- A quadratic integer program for the location of interacting hub facilities
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- An enumerative algorithm framework for a class of nonlinear integer programming problems
- The problem of projecting the origin of Euclidean space onto the convex polyhedron
- A stochastic approach to general nonlinear programming problems
- Cyclic projection methods on a class of nonconvex sets
This page was built for publication: Computer experiments on quadratic programming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154392)