×
Bansal, P. P.; Jacobsen, S. E.

Characterization of local solutions for a class of nonconvex programs. (English) Zbl 0281.90078

J. Optimization Theory Appl. 15, 549-564 (1975).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0281.90078

Cited in 16 Documents

MSC:

90C35 Programming involving graphs or networks
90C30 Nonlinear programming
Cite Review PDF
Full Text: DOI

References:

[1] Soland, R. M.,An Algorithm for Separable Nonconvex Programming Problems, II, Nonconvex Constraints, Management Science, Vol. 17, pp. 759-773, 1971. · Zbl 0226.90038 · doi:10.1287/mnsc.17.11.759
[2] Rosen, J. B.,Iterative Solution of Nonlinear Optimal Control Problems, SIAM Journal on Control, Vol. 4, pp. 223-244, 1966. · Zbl 0229.49025 · doi:10.1137/0304021
[3] Meyer, R.,The Validity of a Family of Optimization Methods, SIAM Journal on Control, Vol. 8, pp. 41-54, 1970. · Zbl 0194.20501 · doi:10.1137/0308003
[4] Benders, J. F.,Partitioning Procedures for Solving Mixed-Variables Programming Problems, Numerische Mathematik, Vol. 4, pp. 238-252, 1962. · Zbl 0109.38302 · doi:10.1007/BF01386316
[5] Geoffrion, A. M.,Generalized Benders Decomposition, Journal of Optimization Theory and Applications, Vol. 4, pp. 237-260, 1972. · Zbl 0229.90024 · doi:10.1007/BF00934810
[6] Tucker, A. W.,Dual Systems of Homogeneous Linear Relations, Linear Inequalities and Related Systems, Edited by H. W. Kuhn and A. W. Tucker, Princeton University Press, Princeton, New Jersey, 1956. · Zbl 0072.37503
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.