A least-distance programming procedure for minimization problems under linear constraints-Reference-Cited by-同舟云学术

A least-distance programming procedure for minimization problems under linear constraints

Published:1983-08 Issue:4 Volume:40 Page:489-514
ISSN:0022-3239
Container-title:Journal of Optimization Theory and Applications
language:en
Short-container-title:J Optim Theory Appl

Author:

Bazaraa M. S.,Goode J. J.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF00933968.pdf

Reference24 articles.

1. Murtagh, B. A., andSaunders, M. A.,Large-Scale Linearly Constrained Optimization, Mathematical Programming, Vol. 14, pp. 41?72, 1978.

2. Wolfe, P.,Methods of Nonlinear Programming, Nonlinear Programming, Edited by J. Abadie, North Holland, Amsterdam, Holland, 1967.

3. Zangwill, W. I.,The Convex Simplex Method, Management Science, Vol. 14, pp. 221?283, 1967.

4. Shanno, D. F., andMarsten, R. E.,Conjugate Gradient Methods for Linearly Constrained Nonlinear Programming, University of Arizona, MIS Technical Report No. 79?13, 1979.

5. Goldfarb, D.,Extension of Davidon's Variable Metric Method to Maximization under Linear Inequality and Equality Constraints, SIAM Journal on Applied Mathematics, Vol. 17, pp. 739?764, 1969.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Poljak's improved subgradient method;Journal of Optimization Theory and Applications;1988-05

2. On convergence properties of a least-distance programming procedure for minimization problems under linear constraints;Journal of Optimization Theory and Applications;1986-08