From Convex Optimization to Nonconvex Optimization. Necessary and Sufficient Conditions for Global Optimality

Nonconvex minimization problems form an old subject which has received a growing interest in the recent years. The main incentive comes from modelling in Applied Mathematics and Operations Research, where one may be faced with optimization problems like: minimizing (globally) a difference of convex functions, maximizing a convex function over a convex set, minimizing an indefinite quadratic form over a polyhedral convex set, etc.

[1]  J. Zowe,et al.  Some remarks on the construction of higher order algorithms in convex optimization , 1983 .

[2]  Quan Zheng,et al.  Integral Global Optimization , 1988 .

[3]  Roland Durier.  On Locally Polyhedral Convex Functions , 1988 .

[4]  J. Hiriart-Urruty,et al.  Trends in Mathematical Optimization , 1987 .

[5]  J. Hiriart-Urruty.  Lipschitz $r$-continuity of the approximative subdifferential of a convex function. , 1980 .

[6]  I. Singer.  Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems , 1979 .

[7]  Jacob Ponstein.  Convexity and Duality in Optimization , 1985 .

[8]  R. Horst,et al.  On the global minimization of concave functions , 1984 .

[9]  J. Hiriart-Urruty.  Generalized Differentiability / Duality and Optimization for Problems Dealing with Differences of Convex Functions , 1985 .

[10]  J. Toland.  A duality principle for non-convex optimisation and the calculus of variations , 1979 .

[11]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[12]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[13]  Jean-Baptiste Hiriart-Urruty.  Limiting behaviour of the approximate first order and second order directional derivatives for a convex function , 1982 .

[14]  Jean-Baptiste Hiriart-Urruty,et al.  A First Order Sufficient Condition for Optimality in Nonsmooth Optimization , 1989 .