Iterative Methods for Large Convex Quadratic Programs: A Survey
- 1 March 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 25 (2), 383-411
- https://doi.org/10.1137/0325023
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- A lagrangean relaxation algorithm for the constrained matrix problemNaval Research Logistics Quarterly, 1986
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984
- On Convergence of the PIES Algorithm for Computing EquilibriaOperations Research, 1982
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problemsPublished by Springer Nature ,1982
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981
- Solution of nonsymmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1981
- Dualität und Approximation bei konvexen OptimierungsproblemenZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1978
- On the solution of large, structured linear complementarity problems: The block partitioned caseApplied Mathematics & Optimization, 1977
- Monotone solutions of the parametric linear complementarity problemMathematical Programming, 1972
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954