Annals of Operations Research

, Volume 25, Issue 1, pp 1–17 | Cite as

On solving general reverse convex programming problems by a sequence of linear programs and line searches

  • Reiner Horst
  • Thai Q. Phong
  • Nguyen V. Thoai
Article

Abstract

Many multiextremal global optimization problems can be formulated as problems of minimizing a linear function over the intersection of a convex set with the complement of a convex set (so-called canonical d.c. programs or general reverse convex programming problems). In this paper it is shown that these general reverse convex programming problems can be solved by a sequence of linear programs and univariate convex minimization problems (line searches).

Keywords

Linear Function Global Optimization Programming Problem Minimization Problem Line Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    F.A. Al-Khayyal and J.E. Falk, Jointly constrained biconvex programming, Math. Oper. Res. 8(2) (1983) 273–286.Google Scholar
  2. [2]
    P.P. Bansal and S.E. Jacobsen, An algorithm for optimizing network flow capacity under economies of scale. J. Optimization Theory Appl. 15 (1975) 565–586.Google Scholar
  3. [3]
    H.P. Benson, On the convergence of two branch and bound algorithms for nonconvex programming problems. J. Optimization Theory Appl. 36 (1982) 129–134.Google Scholar
  4. [4]
    H.P. Benson and R. Horst, A branch and bound outer approximation algorithm for concave minimization over a convex set. J. Comp. Math. Appl., to be published.Google Scholar
  5. [5]
    F. Giannessi, L. Jurina and G. Maier, Optimal excavation profile for a pipeline freely resting on the sea floor, Engineering Structures 1 (1979) 81–91.Google Scholar
  6. [6]
    B. Heron and M. Sermange, Nonconvex methods for computing free boundary equilibra of axially symmetric plasmas, Appl. Math. Optimization 8 (1982) 351–382.Google Scholar
  7. [7]
    R.J. Hillestad, Optimization problems subject to a budget constraint with economies of scale, Oper. Res. 23 (1975) 1091–1098.Google Scholar
  8. [8]
    R.J. Hillestad and S.E. Jacobsen, Linear Programs with an additional reverse convex constraint. Appl. Math. Optimization 6 (1980) 257–269.Google Scholar
  9. [9]
    J.B. Hiriart-Urruty, Generalized differentiability, duality and optimization for problems dealing with differences of convex functions,Lecture Notes in Economics and Mathematical Systems, vol. 256 (Springer, 1985) pp. 37–69.Google Scholar
  10. [10]
    K.L. Hoffman, A method for globally minimizing concave functions over convex sets. Math. Programming 20 (1981) 22–32.Google Scholar
  11. [11]
    R. Horst, A new branch and bound approach for concave minimization problems,Lecture Notes in Computer Science, vol. 41 (Springer, 1976) pp. 330–337.Google Scholar
  12. [12]
    R. Horst, An algorithm for nonconvex programming problems, Math. Programming 10 (1976) 312–321.Google Scholar
  13. [13]
    R. Horst, A note on the convergence of an algorithm for nonconvex programming problems, Math. Programming 19 (1980) 237–238.Google Scholar
  14. [14]
    R. Horst, On the global minimization of concave functions: introduction and survey, Oper. Res. Spektrum 6 (1984) 195–205.Google Scholar
  15. [15]
    R. Horst, A general class of branch and bound methods in global optimization with some new approaches for concave minimization. J. Optimization Theory Appl. 51 (1986) 271–291.Google Scholar
  16. [16]
    R. Horst, Deterministic global optimization with partition sets whose feasibility is not known. Application to concave minimization, reverse convex constraints, d.c-programming and Lipschitzian optimization. J. Optimization Theory Appl. 58 (1988) 11–37.Google Scholar
  17. [17]
    R. Horst, On consistency of bounding operations in deterministic global optimization, J. Optimization Theory Appl. 61 (1989) 143–146.Google Scholar
  18. [18]
    R. Horst, Deterministic global optimization: recent advances and new fields of application, Naval Res. Logistics, to be published.Google Scholar
  19. [19]
    R. Horst and N.V. Thoai, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, Computing 42 (1989) 271–289.Google Scholar
  20. [20]
    R. Horst, N.V. Thoai and H.P. Benson, Concave minimization via conical partitions and polyhedral outer approximation, Math. Programming, to be published.Google Scholar
  21. [21]
    R. Horst, N.V. Thoai and J. de Vries, On finding new vertices and redundant constraints in cutting plane algorithms for global optimization, Oper. Res. Lett. 7 (1988) 85–90.Google Scholar
  22. [22]
    R. Horst, N.V. Thoai and H. Tuy, Outer approximation by polyhedral convex sets.Oper. Res. Spektrum 9 (3) (1987) 153–159.Google Scholar
  23. [23]
    R. Horst, N.V. Thoai and H. Tuy, On an outer approximation concept in global optimization, Optimization 20 (1989) 255–264.Google Scholar
  24. [24]
    R. Horst and H. Tuy, On the convergence of global methods in multiextremal optimization, J. Optimization Theory Appl. 54 (1987) 254–271.Google Scholar
  25. [25]
    R. Horst and H. Tuy,Global Optimization: Deterministic Approaches (Springer, 1990).Google Scholar
  26. [26]
    V.H. Nguyen, J.J. Strodiot and N.V. Thoai, On an optimum shape design problem, Technical Report 85/5, Department of Mathematics, University of Namur (1985).Google Scholar
  27. [27]
    P.M. Pardalos, Global optimization algorithms for linearly constrained indefinite quadratic problems, J. Computers Math. Appl., to be published.Google Scholar
  28. [28]
    P.M. Pardalos, J.H. Glick and J.B. Rosen, Global minimization of indefinite quadratic problems, Computing 39 (1987) 281–291.Google Scholar
  29. [29]
    P.M. Pardalos and J.B. Rosen, Constrained global optimization: algorithms and applications,Lecture Notes on Computer Science, vol. 268 (Springer, 1987).Google Scholar
  30. [30]
    P.T. Thach, The design centering problem as a d. c. program, Math. Programming 41 (1988) 229–248.Google Scholar
  31. [31]
    P.T. Thach and H. Tuy, Global optimization under Lipschitzian constraints, Jpn. J. Appl. Math. 4 (2) (1987) 205–217.Google Scholar
  32. [32]
    N.V. Thoai, A modified version of Tuy's method for solving d.c. programming problems, Optimization 19 (1988) 665–674.Google Scholar
  33. [33]
    N.V. Thoai and H. Tuy, Convergent algorithms for minimizing a concave function. Math. Oper. Res. 5 (1980) 556–566.Google Scholar
  34. [34]
    T.V. Thuong and H. Tuy, A finite algorithm for solving linear programs with an additional reverse convex constraint,Lecture Notes in Economics and Mathematical Systems, vol. 225 (Springer, 1984) pp. 291–302.Google Scholar
  35. [35]
    J.F. Toland, Duality in nonconvex optimization, J.Math. Anal. Appl. 66 (1978) 399–415.Google Scholar
  36. [36]
    J.F. Toland, A duality principle for nonconvex optimization and the calculus of variations Arch. Rational Mechanics and Anal. 71 (1978) 41–61.Google Scholar
  37. [37]
    H. Tuy, Global minimization of a difference of two convex functions, in:Selected Topics in Operations Research and Mathematical Economics, Lecture Notes in Economics and Mathematical Systems, vol. 226, eds. G. Hammer and D. Pallaschke (Springer, 1985) pp. 98–118.Google Scholar
  38. [38]
    H. Tuy, A general deterministic approach to global optimization via d.c. programming, in:Fermat Days 1985: Mathematics for Optimization, ed. J.B. Hiriart-Urruty (North-Holland, Amsterdam, 1986) pp. 137–162.Google Scholar
  39. [39]
    H. Tuy. Global minimization of a difference of two convex functions, Math. Programming Study 30 (1987) 150–182.Google Scholar
  40. [40]
    H. Tuy, Convex programs with an additional reverse convex constraint, J. Optimization Theory Appl. 52 (1987) 463–485.Google Scholar
  41. [41]
    H. Tuy and R. Horst, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems. Math. Programming 41 (1988) 161–183.Google Scholar
  42. [42]
    H. Tuy, V. Khachaturov and S. Utkin, A class of exhaustive cone splitting procedures in conical algorithms for concave minimization, Optimization 18 (1987) 791–807.Google Scholar
  43. [43]
    H. Tuy, T.V. Thieu and N.Q. Thai, A conical algorithm for globally minimizing a concave function over a closed convex set. Math. Oper. Res. 10 (1985) 498–514.Google Scholar
  44. [44]
    H. Tuy and N.V. Thuong, Minimizing a convex function over the complement of a convex set, Meth. Oper. Res. 49 (1985) 85–99.Google Scholar
  45. [45]
    H. Tuy and N.V. Thuong, On the global minimization of a convex function under general nonconvex constraints, Appl. Math. Optimization 18 (1988) 119–142.Google Scholar
  46. [46]
    U. Ueing, A combinatorial method to compute the global solution of certain non-convex optimization problems, in:Numerical Methods for Nonlinear Optimization, ed. F.A. Lootsma (Academic Press. 1972) pp. 223–230.Google Scholar
  47. [47]
    A.B. Zaleesky, Nonconvexity of feasible domains and optimization of management decision, (in Russian), Ekonomika i Matematitcheskie Metody 16 (1980) 1069–1081.Google Scholar

Copyright information

© J.C. Baltzer A.G. Scientific Publishing Company 1990

Authors and Affiliations

  • Reiner Horst
    • 1
  • Thai Q. Phong
    • 2
  • Nguyen V. Thoai
  1. 1.Universität TrierTrierF.R. Germany
  2. 2.Institute of MathematicsHanoiVietnam

Personalised recommendations