×

zbMATH — the first resource for mathematics

Computability of global solutions to factorable nonconvex programs. I: Convex underestimating problems. (English) Zbl 0349.90100

MSC:
90C30 Nonlinear programming
65K05 Numerical mathematical programming methods
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] E.M.L. Beale and J.A. Tomlin, ”Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables”, in: J. Laurence, ed.,Proceedings of the fifth international conference on operational research (Tavistock Publications, London, 1970) pp. 447–454.
[2] J.E. Falk and R.M. Soland, ”An algorithm for separable nonconvex programming probblems”,Management Science 15(9) (1969) 550–569. · Zbl 0172.43802
[3] G.P. McCormick, ”Converting general nonlinear programming problems to separable nonlinear programming problems”, Technical Paper Serial T-267, Program in Logistics, The George Washington University, Washington, D.C. (1972).
[4] G.P. McCormick, ”Attempts to calculate global solutions of problems that may have local minima”, in: F.A. Lootsma, ed.,Numerical methods for nonlinear optimization (Academic Press, New York, 1972) pp. 209–221.
[5] R.M. Soland, ”An algorithm for separable nonconvex programming problems II: nonconvex constraints”,Management Science 17(11) (1971) 759–773. · Zbl 0226.90038
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.