Large-scale linearly constrained optimization
Open Access
- 1 December 1978
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 14 (1), 41-72
- https://doi.org/10.1007/bf01588950
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Linear Programming via a Nondifferentiable Penalty FunctionSIAM Journal on Numerical Analysis, 1976
- A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING††Research for this paper was supported by the Energy Research and Development Administration Contract AT(04-3)-326 PA #18, at Stanford University.Published by Elsevier BV ,1976
- An alternate implementation of Goldfarb's minimization algorithmMathematical Programming, 1975
- Reducing the retrieval time of scatter storage techniquesCommunications of the ACM, 1973
- The Partitioned Preassigned Pivot Procedure (P4)Published by Springer Science and Business Media LLC ,1972
- A stabilization of the simplex methodNumerische Mathematik, 1971
- A Second Order Method for the Linearly Constrained Nonlinear Programming ProblemPublished by Elsevier BV ,1970
- The simplex method of linear programming using LU decompositionCommunications of the ACM, 1969
- Function minimization by conjugate gradientsThe Computer Journal, 1964
- A Rapidly Convergent Descent Method for MinimizationThe Computer Journal, 1963