Computer experiments on quadratic programming algorithms
From MaRDI portal
Publication:1154392
DOI10.1016/0377-2217(81)90257-5zbMath0464.90064OpenAlexW2089174804MaRDI QIDQ1154392
Publication date: 1981
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(81)90257-5
computational studycomparison of algorithmsconvex simplex methodLemke's complementary pivot methodquadratic differential algorithmWolfe's simplex method
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Quadratic programming (90C20)
Related Items
A Stochastic Approach to General Nonlinear Programming Problems, A quadratic integer program for the location of interacting hub facilities, A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem, The problem of projecting the origin of Euclidean space onto the convex polyhedron, Cyclic projection methods on a class of nonconvex sets, An enumerative algorithm framework for a class of nonlinear integer programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-person nonzero-sum games and quadratic programming
- The Simplex Method for Quadratic Programming
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
- Reporting computational experiments in mathematical programming
- A quadratic programming algorithm using conjugate search directions
- A critical review of comparisons of mathematical programming algorithms and software (1953-1977)
- Some Programming Problems in Population Projection
- A Comparison of Two Methods for Quadratic Programming
- Bimatrix Equilibrium Points and Mathematical Programming
- The Convex Simplex Method
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- A Computer Comparison of Four Quadratic Programming Algorithms
- A comparison of the primal‐simplex and complementary pivot methods for linear programming