Summary
This paper deals with outer approximation methods for solving possibly multiextremal global optimization problems. A general theorem on convergence is presented and new classes of outer approximation methods using polyhedral convex sets are derived. The underlying theory is then related to the cut map-separator theory of Eaves and Zangwill. Two constraint dropping strategies are deduced.
Zusammenfassung
Diese Arbeit befaßt sich mit äußeren Approximationsverfahren zur Lösung von möglicherweise multiextremalen globalen Optimierungsproblemen. Ein allgemeiner Konvergenzsatz wird vorgestellt, aus dem sich neue Klassen von Schnittebenenverfahren ableiten lassen. Schließlich wird die dargestellte Theorie in Bezug gesetzt zur Schnittabbildung-Separatoren-Theorie von Eaves und Zangwill. Zwei Strategien zur Reduzierung der Nebenbedingungen werden vorgestellt.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cheney EW, Goldstein AA (1959) Newton's method for convex programming and Tchebycheff approximation. Numer Math 1:253–268
Eaves BC, Zangwill WI (1971) Generalized cutting plane algorithms. SIAM J Control 9:529–542
Falk J, Hoffman KR (1976) A successive underestimation method for concave minimization problems. Math Oper Res 1:251–259
Fukushima M (1983) An outer approximation algorithm for solving general convex programs. Oper Res 31:101–113
Fukushima M (1984) On the convergence of a class of outer approximation algorithms for convex programs. J Comput Appl Math 10:147–156
Hoffman KR (1981) A method for globally minimizing concave functions over convex sets. Math Programm 20:22–32
Hogan WW (1973) Applications of a general convergence theory for outer approximation algorithms. Math Programm 5:151–168
Kelley JE (1960) The cutting — plane method for solving convex programs. J SIAM 8:703–712
Leviting ES, Polyak BT (1966) Constrained minimization methods. USSR Comput Math Math Phys 6:1–50
Mayne DQ, Polak E (1984) Outer approximation algorithm for nondifferentiable optimization problems. J Optimization Theory Appl 42:19–30
Parikh SC (1976) Approximate cutting planes in nonlinear programming. Math Programm 11:184–198
Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton, NJ
Thieu TV, Tarn BT, Ban VT (1983) An outer approximation method for global minimizing a concave function over a compact convex set. Acta Math Vietnam 8:21–40
Thoai Ng V (1984) Verfahren zur Lösung konkaver Optimierungsaufgaben. Seminarberichte, Sektion Mathematik der Humboldt-Universität zu Berlin 63
Topkis DM (1970) Cutting plane methods without nested constraint sets. Oper Res 18:404–413
Tuy H, Horst R (1986) Convergence and restart in branchand-bound algorithms for global optimization. Application to concave minimization and D. C. optimization problems. Preprint University of Trier (submitted for publication)
Veinott AF (1967) The supporting hyperplane method for unimodal programming. Oper Res 15:147–152
Author information
Authors and Affiliations
Additional information
This research was accomplished while this author was with the University of Trier as a fellow of the Alexander von Humboldtfoundation
Rights and permissions
About this article
Cite this article
Horst, R., Thoai, N.V. & Tuy, H. Outer approximation by polyhedral convex sets. OR Spektrum 9, 153–159 (1987). https://doi.org/10.1007/BF01721096
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01721096