On the degree and separability of nonconvexity and applications to optimization problems

Mathematical Programming, Series B

Volumn 77, Issue 3, 1997, Pages 23-47

  Thach, Phan Thien ^a,b   Konno, Hiroshi ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b Institute of Mathematics   (Viet Nam)

Author keywords

Duality; Generalized convexity; Optimization

Indexed keywords

EID: 15244339898     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. E. Asplund, Differentiability of the metric projection in finite dimensional Euclidean space. Proc. Amer. Math. Soc. 38 (1973) 218-219.
2. J.-P. Aubin and I. Ekeland, Estimates of the duality gap in nonconvex optimization, Math. Oper. Res. 1 (1976) 225-245.
3. E. Balas, J.M. Tama and J. Tind, Sequential convexification in reverse convex and disjunctive programming, Math. Prog. 44 (1989) 337-350.
4. B.C. Eaves and W.I. Zangwill, Generalized cutting plane algorithm, SIAM J. Control 9 (1971) 529-542.
5. I. Ekeland and R. Temam, Convex Analysis and Variational Problems (North-Holland, Amsterdam, 1976).
6. P. Hartman, On functions representable as a difference of convex functions, Pacific J. Math. 9 (1959) 707-713.
7. J.B. Hiriart-Urruty, Generalized differentiability, duality and optimization for problems dealing with differences of convex functions, in: J. Ponstain, ed., Lectures Notes in Economics and Mathematical Systems, Vol. 256 (Springer, New York, 1984) 37-70.
8. J.B. Hiriart-Urruty, Conditions necessaires et suffisantes d'optimalite globale en optimization de differences de deux fonctions convexes, C.R. Acad. Sci. Paris 309 (1989) 459-462.
9. R. Horst and H. Tuy, Global Optimization: Deterministic Approaches (Springer, Berlin, 1990).
10. T.C. Hu, V. Klee and D. Larman, Optimization of globally convex functions, SIAM Control Optim. 27 (1989) 1026-1047.
11. A.D. Ioffe and V.M. Tikhomirov, Theory of External Problems (North-Holland, Amsterdam, 1979). (A translation from the Russian edition NAUKA, Moscow, 1974.)
12. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (John Wiley and Sons, New York, 1988).
13. J.-P. Penot and M.L. Bougeard, Approximation and decomposition properties of some classes of locally d.c. functions. Math. Prog. 41 (1988) 195-227.
14. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
15. I. Singer, Maximization of lower semi-continuous convex functional on bounded subsets of locally convex spaces I: Hyperplane theorems, Appl. Math. Optim. 5 (1979) 349-362.
16. P.T. Thach, D.c. sets, d.c. functions and nonlinear equations. Math. Prog. 58 (1987) 415-428.
17. P.T. Thach, Quasiconjugates of functions and duality relationship between quasi-convex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications. J. Math. Anal. Appl. 159 (1991) 299-322.
18. J.F. Toland, Duality in nonconvex optimization. J. Math. Anal. Appl. 66 (1978) 399-415.
19. H. Tuy, Global minimization of a difference of two convex functions. Math. Prog. Study 30 (1987) 150-182.
20. S.A. Vavasis, Nonlinear Optimization, Complexity Issues (Oxford University Press, Oxford, UK, 1991).
21. J.-P. Vial, Strong and weak convexity of sets and functions, Math. Oper. Res. 8 (1983) 231-259.
22. Y. Yajima and H. Konno, Efficient algorithms for solving rank two and rank three bilinear programming problems, J. Global Optimization 1 (1991) 65-82.