Abstract
By means of suitable dual problems to the following global optimization problems: extremum{f(x): x εM ⊂X}, wheref is a proper convex and lower-semicontinuous function andM a nonempty, arbitrary subset of a reflexive Banach spaceX, we derive necessary and sufficient optimality conditions for a global minimizer. The method is also applicable to other nonconvex problems and leads to at least necessary global optimality conditions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Auchmuty, G. (1983), Duality for non-convex variational principles,J. Diff. Equations 50, 80–145.
Benacer, R. and Tao, P.D. (1986), Global Maximization of a Non-Definite Quadratic Function over a Convex Polyhedron, in Hiriart-Urruty, J.-B. (ed.),FERMAT DAYS 1985: Mathematics for Optimization, North-Holland, Amsterdam, 65–76.
Bulatov, V.P. (1987), Metody resheniya mnogoekstremal'nykh zadach (global'nykh poisk). Melody chislennogo analize i optimizacii. Novosibirsk, 133–157.
Chew, S.H. and Zheng, W. (1988), Integral global optimization,Lecture Notes Econ. and Math. Systems 289, Springer-Verlag, Berlin.
Clarke, F.H. (1976), A new approach to Lagrange multipliers,Mathematics of Operations Research 1, 165–174.
Craven, B.D., Gwinner, J. and Jeyakumar, V. (1987), Nonconvex theorems of the alterntive and minimization,Optimization 18(2), 151–163.
Dem'yanov, V.F. and Vasil'ev, L.V. (1985),Nondifferentiable Optimization, Optimization Software, Inc., Publications Division, New York.
Ekeland, I. and Temam, R. (1976),Convex Analysis and Variational Problems, North-Holland, Amsterdam.
Galperin, E.A. and Zheng, Q. (1987), Nonlinear observation via global optimization methods: Measure theory approach,J. Optim. Theory Appl. 54(1), 63–92.
Hiriart-Urruty, J.-B. (1989), From convex optimization to non-convex optimization. Part I: Necessary and sufficient conditions for global optimality. Nonsmooth Optimization and Related Topics. Preprint.
Hiriart-Urruty, J.-B. (1985), Generalized differentiability, duality and optimization for problems dealing with differences of convex functions,Lecture Notes in Econ. and Math. Systems 256, 37–70.
Hiriart-Urruty, J.-B. and Lemarechal, C. (1990), Testing necessary and sufficient conditions for global optimality in the problem of maximizing a convex quadratic function over a convex polyhedron. Seminar of Numerical Analysis, University P. Sabatier, Toulouse, Preprint.
Hoffmann, K.L. (1981), A method for globally minimizing concave functions over convex sets,Mathematical Programming 20(1), 22–32.
Horst, R. and Tuy, H. (1990),Global Optimization, Springer-Verlag, Berlin, Heidelberg, New York.
Horst, R. (1984), On the global minimization of concave functions: Introduction and survey,Operations Research Spectrum 6, 195–205.
Horst, R., Thoai, Ng.V. and Tuy, H. (1989), On an outer approximation concept in global optimization,Optimization 20(3), 255–264.
Ioffe, A.D. and Tichomirov, V.M. (1979),Theorie der Extremalaufgaven, VEB Deutscher Verlag der Wissenschaften, Berlin.
Mikhalevich, V.S., Gupal, A.M. and Norkin, V.I. (1987),Melody nevypukloy optimizacii, Moscow, Nauka.
Pardalos, P.M. and Rosen, J.B. (1987), Constrained global optimizaton: Algorithms and applications,Lecture Notes in Computer Science 268, Springer-Verlag, Berlin.
Pintér, J. (1986), Global optimization on convex sets,Operations Research Spectrum 8, 197–202.
Ratschek, H. and Rokne, J. (1988),New Computer Methods for Global Optimization, Ellis Horwood, Chichester.
Ritter, K.A. (1966), A method for maximum problems with a non-concave quadratic objective function,Zeitsch. Wahrsch.-Theorie Verw. Gebiete 4, 340–351.
Snyman, J.A. and Fatti, L.P. (1987), A multi-start global minimization algorithm with dynamical search trajectories,J. Optim. Theory Appl. 54, 121–141.
Strekalovskiy, A.S. (1990), K problemam global'novo ekstremumav nevypuklykh ekstremal'nykh zadach,Izvestiya Vysshikh Uchebnykh Zavedeniy Matematika 8, 74–80.
Sukharev, A.G., Timorov, A.V. and Fyodorov, V.V. (1986),Kurs metodov optimizacii, Nauka, Moscow.
Tao, P.D. (1986), Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients, inFermat Days 85: Mathematics for Optimization, North-Holland, Amsterdam.
Thach, P.T. and Tuy, H., (1987), Global optimization under Lipschitzian Constraints,Japan J. Appl. Math. 4, 205–217.
Tuy, H. (1986), A general deterministic approach to global optimization via d.c.-programming, inFermat Days 85: Mathematics for Optimization, North-Holland, Amsterdam.
Toland, F.H. (1978), Duality in non-convex optimization,J. Math. Anal. Appl. 66, 399–415.
Chichinadze, V.K. (1983), Resheniye nevypuklykh nelineynykh zadach optimizacii,Metod Ψ-preobrazovaniya, Moscow, Nauka.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dietrich, H. Global optimization conditions for certain nonconvex minimization problems. J Glob Optim 5, 359–370 (1994). https://doi.org/10.1007/BF01096685
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01096685