Sequential Search: A Method for Solving Constrained Optimization Problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Sequential Search: A Method for Solving Constrained Optimization Problems

Full text

Pdf (564 KB)

Source

Journal of the ACM (JACM) archive
Volume 12 , Issue 1 (January 1965) table of contents

Pages: 71 - 82

Year of Publication: 1965

ISSN:0004-5411

Authors

H. Glass	Washington University, St. Louis, Missouri
L. Cooper	Washington University, St. Louis, Missouri

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 43, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321250.321256 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Robert Hooke , T. A. Jeeves, `` Direct Search'' Solution of Numerical and Statistical Problems, Journal of the ACM (JACM), v.8 n.2, p.212-229, April 1961 [doi>10.1145/321062.321069]
	2	DANTY, IC G. B. aximization of linear linmear of Valiabls subject to linear in. equalities. In Aetiity Azalysis of Production gud Allocation, Wiley, New York, 1951
	3	KELLY, J. E. ,In. The eutdng-plane method Ior solvitg convex progamz. SlAM J.1 (1960) 703.
	4	ROSENY, J. B. The gradient projection method for uon-litlear programming, part Linear Constrkts, SIAM J. 8 (1960), 181.
	5	---, The grdient projection method for non-linear programming, part I. N0tL. Linear Const, rainta, SIAM J, 9 (I961), 514.
	6	DENNIS J. B. Mathetn, atical Progamminff and Eleeical :Vetworks. Wiley, New York, 1959.
	7	Amow, K. J., ANt ttLgwtcz, L. Gradient met, hods for constrained meximtml. J, Opcr. Res. Soc. 5 (1957) 258.
	8	---,D --, Uzw,, H. Studies in, Linen:; and NonLinear' Programming. StAnfORd U. Press, Stanford, 1958
	9	BRowN, R, It. Gradient methods for the computer solutiols of system optImizatIen problems. Wright Air Develop. Ctr. Tech. Note 57-159, 1957.
	10	SPANG, H. A. IiI. A review of miniraiztion techniques for ron-linear iunctiOn. SIAM Rev. 4 (1962), 343.
	11	HOUEhOLOER, A.S. Principles of ArumevicaL Analysis. McGraw-Hill, New York 19 152.

CITED BY 4

	Tamio Shimizu, A Stochastic Approximation Method for Optimization Problems, Journal of the ACM (JACM), v.16 n.3, p.511-516, July 1969
	Roger Ferguson , Bogdan Korel, The chaining approach for software test data generation, ACM Transactions on Software Engineering and Methodology (TOSEM), v.5 n.1, p.63-86, Jan. 1996
	Robert E. Echols , Leon Cooper, Solution of Integer Linear Programming Problems by Direct Search, Journal of the ACM (JACM), v.15 n.1, p.75-84, Jan. 1968
	B. Korel, Automated Software Test Data Generation, IEEE Transactions on Software Engineering, v.16 n.8, p.870-879, August 1990