D.C. programming for solving a class of global optimization problems via reformulation by exact penalty

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2861, Issue , 2003, Pages 87-101

  An, Le Thi Hoai ^a  

^a UNIVERSITÉ ET INSA DE ROUEN   (France)

Author keywords

Combined DCA branch and bound algorithm; d.c. programming; DCA; Exact penalty; Polyhedral d.c. programming; Reformulations

Indexed keywords

BRANCH AND BOUND METHOD; FUNCTIONS; GLOBAL OPTIMIZATION; SET THEORY;

BRANCH-AND-BOUND ALGORITHMS; D.C. PROGRAMMING; DIFFERENCE OF CONVEX FUNCTIONS; EXACT PENALTY; GLOBAL OPTIMIZATION PROBLEMS; LINEAR COMPLEMENTARITY; OPTIMIZATION ALGORITHMS; REFORMULATIONS;

EQUIVALENCE CLASSES;

EID: 0242459943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39901-8_7     Document Type: Article

References (27)

1. LE THI HOAI AN, Contribution à l'optimisation non convexe et l'optimisation globale: Théorie, Algorithmes et Applications, Habilitation à Diriger des Recherches, Université de Rouen, Juin 1997.
2. LE THI HOAI AN and PHAM DINH TAO, Solving a class of linearly constrained indefinite quadratic problems by D.c. algorithms, Journal of Global Optimization, 11 (1997), pp. 253-285.
3. LE THI HOAI AN and PHAM DINH TAO, A continuous approach for large-scale linearly constrained quadratic zero-one programming, Optimization, Vol. 50, No. 1-2, pp. 93-120 (2001).
4. LE THI HOAI AN, PHAM DINH TAO and LE DUNG MUU, Numerical solution for Optimization over the efficient set by D.c. Optimization Algorithm, Operations Research Letters, 19 (1996) pp. 117-128.
5. LE THI HOAI AN, PHAM DINH TAO and LE DUNG MUU, Exact penalty in d.c. programming, Vietnam Journal of Mathematics, 27:2 (1999), pp. 169-178.
6. LE THI HOAI AN, PHAM DINH TAO and LE DUNG MUU, Simplicially constrained d.c. Optimization for optimizing over the Efficient and weakly efficient sets, Journal of Optimization Theory and Applications, Vol 117, No 3 (2003), pp 503-531.
7. BENSON, H. P., Optimization over the Efficient Set, Journal of Mathematical Analysis and Applications, Vol.98, pp. 562-580, 1984.
8. BOLITINEANU, S., Minimization of a Quasi-concave Function over an Efficient Set, Mathematical Programming, Vol. 61, pp. 89-110, 1993.
9. J. B. HIRIAT URRUTY and C. LEMARECHAL, Convex Analysis and Minimization Algorithms, Springer Verlag Berlin Heidelberg, 1993.
10. R. HORST, T.Q. PHONG, N.V. THOAI and J. VRIES, On Solving a D.C. Programming Problem by a Sequence of Linear Programs, Journal of Global Optimization 1(1991), pp. 183-203.
11. R. HORST and H. TUY, Global optimization (Deterministic approaches), Springer-Verlag, Berlin (1993).
12. P. LORIDAN, J. MORGAN, Approximation solutions for two-level optimization problems, Trends in Mathematical Optimization, International Series of Numer. Math. Vol 84 (1988), Birkhäuser, pp. 181-196.
13. PHAM DINH TAO, Algorithms for solving a class of non convex optimization problems. Methods of subgradients,Fermat days 85. Mathematics for Optimization, J. B. Hiriart Urruty (ed.), Elsevier Science Publishers B. V. North-Holland, 1986.
14. PHAM DINH TAO, S.EL. BERNOUSSI, Duality in d.c. (difference of convex functions) optimization. Subgradient methods, Trends in Mathematical Optimization, International Series of Numer Math. Vol 84 (1988), Birkhauser, pp. 277-293.
15. PHAM DINH TAO and LE THI HOAI AN, D.c. optimization algorithms for solving the trust region subproblem, SIAM J. Optimization, Vol 8, No 2 (1998), pp. 476-505.
16. PHAM DINH TAO and LE THI HOAI AN, Convex analysis approach to d.c. programming. Theory, algorithms and applications, (Dedicated to Professor Hoang Tuy on the occasion of his 70th birth day), Acta Mathematica Vietnamica, Vol. 22, Number 1 (1997), pp. 289-355.
17. J. PHILIP, Algorithms for the vector maximization problem, Mathematical Programming 2 (1972), pp. 207-229.
18. ROCKAFELLAR, R. T., Convex Analysis. Princeton University Press, 1970.
19. K. SHIMIZU, E. AIYOSHI, A new computation method for Stackelberg and minmax problem by use of a penalty method, IEEE Transactions on Automatic Control, Vol. AC-26, No. 2(1981), pp. 460-466.
20. M. SIMAAN, J. CRUZ, On the Stackelberg strategy in nonzero-sum games, Journal of Optimization Theory and Applications 11, No. 5 (1973), pp. 533-555.
21. STEUER R. E., Multiple Criteria Optimization: Theory, Computation and Application, John Willey and Sons, New York, New York 1986.
22. S. A. VAVASIS (1991), Nonlinear Optimization, Complexity Issues, Oxford University Press.
23. P. T. THACH, D.c. sets, d.c. functions and nonlinear equations, Mathematical Programming, 58 (1993), pp 415-428.
24. H. TUY, A general deterministic approach to global optimization via d.c. programming, Fermat days 85, Mathematics for Optimization, J. B. Hiriart Urruty (ed.), Elsevier Science Publishers B. V. North-Holland (1986), pp. 273-303.
25. H. TUY, Global minimization of difference of two convex functions, Mathematical Programming Study 30 (1987), pp. 159-182.
26. H. TUY, D.c. programming, In Handbook of Global Optimization, edited by R. Horst and Panos M. Pardalos, Kluwer Academic Publishers (1995).
27. H. TUY, Convex Analysis and Global Optimization, Kluwer Academic Publishers, Boston, Dordrecht, London, 1998.