×

A penalty linear programming method using reduced-gradient basis-exchange techniques. (English) Zbl 0431.90042


MSC:

90C05 Linear programming
65K05 Numerical mathematical programming methods

Citations:

Zbl 0333.90029
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bartels, R. H.; Golub, G. H.; Saunders, M. A., Numerical techniques in mathematical programming, (Rosen, J. B.; Mangasarian, O. I.; Ritter, K., Nonlinear Programming (1970), Academic: Academic New York) · Zbl 0228.90030
[2] Bartels, R. H.; Conn, A. R.; Sinclair, J. W., Minimization techniques for piecewise differentiable functions: The \(l_1\) solution to an overdetermined linear system, SIAM J. Numer. Anal., 15, 224-241 (1978) · Zbl 0376.65018
[5] Conn, A. R., Linear programming via a nondifferentiable penalty function, SIAM J. Numer. Anal., 13, 145-154 (1976) · Zbl 0333.90029
[6] Hadley, G., Linear Programming (1962), Addison-Wesley · Zbl 0102.36304
[7] Hanson, R. J.; Wisniewski, J. A., A mathematical programming updating method using modified Givens transformations and applied to LP problems, (Technical Report SAND77-2023J (1977), Sandia National Laboratories: Sandia National Laboratories Albuquerque, NM), 87115 · Zbl 0401.90075
[8] International Mathematical and Statistical Libraries, IMSL (1977), Sixth Floor, GNB Building, 7500 Bellaire Boulevard, Houston, TX 77036
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.