Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- 1 July 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 18 (4) , 444-454
- https://doi.org/10.1137/0318033
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981
- An algorithm for finding the shortest element of a polyhedral set with application to lagrangian dualityJournal of Mathematical Analysis and Applications, 1978
- On Perturbations in Systems of Linear InequalitiesSIAM Journal on Numerical Analysis, 1973
- The Solution of a Quadratic Programming Problem Using Systematic OverrelaxationSIAM Journal on Control, 1971
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967
- The method of projections for finding the common point of convex setsUSSR Computational Mathematics and Mathematical Physics, 1967
- Solution of an Abel-type integral equation in the presence of noise by quadratic programmingNumerische Mathematik, 1966
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963
- A convex programming procedureNaval Research Logistics Quarterly, 1959
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954