Skip to main content
SpringerLink
Log in

Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A crucial problem for many global optimization methods is how to handle partition sets whose feasibility is not known. This problem is solved for broad classes of feasible sets including convex sets, sets defined by finitely many convex and reverse convex constraints, and sets defined by Lipschitzian inequalities. Moreover, a fairly general theory of bounding is presented and applied to concave objective functions, to functions representable as differences of two convex functions, and to Lipschitzian functions. The resulting algorithms allow one to solve any global optimization problem whose objective function is of one of these forms and whose feasible set belongs to one of the above classes. In this way, several new fields of optimization are opened to the application of global methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Falk, J., andSoland, R. M.,An Algorithm for Separable Nonconvex Programming Problems, Management Science, Vol. 15, pp. 550–569, 1969.

    Google Scholar 

  2. Horst, R.,An Algorithm for Nonconvex Programming Problems, Mathematical Programming, Vol. 10, pp. 312–321, 1976.

    Google Scholar 

  3. Horst, R.,A Note on the Convergence of an Algorithm for Nonconvex Programming Problems, Mathematical Programming, Vol. 19, pp. 237–238, 1980.

    Google Scholar 

  4. Benson, H. P.,On the Convergence of Two Branch-and-Bound Algorithms for Nonconvex Programming Problems, Journal of Optimization Theory and Applications, Vol. 36, pp. 129–134, 1982.

    Google Scholar 

  5. Benson, H. P.,A Finite Algorithm for Concave Minimization over a Polyhedron, Naval Research Logistic Quarterly, Vol. 32, pp. 165–177, 1985.

    Google Scholar 

  6. Rosen, J. B.,Global Minimization of a Linearly Constrained Concave Function by Partition of the Feasible Domain, Mathematics of Operations Research, Vol. 8, pp. 215–230, 1983.

    Google Scholar 

  7. Thaoi, N., andTuy, H.,Convergent Algorithms for Minimizing a Concave Function, Mathematics of Operations Research, Vol. 5, pp. 556–566, 1980.

    Google Scholar 

  8. Tuy, H., Thieu, T. V., andThai, N. Q.,A Conical Algorithm for Globally Minimizing a Concave Function over a Closed Convex Set, Mathematics of Operations Research, Vol. 10, pp. 498–514, 1985.

    Google Scholar 

  9. Al-Khayyal, F. A., andFalk, J.,Jointly Constrained Biconvex Programming, Mathematics of Operations Research, Vol. 8, pp. 273–386, 1983.

    Google Scholar 

  10. Horst, R.,On the Global Minimization of Concave Functions: Introduction and Survey, Operations Research Spektrum, Vol. 6, pp. 195–205, 1984.

    Google Scholar 

  11. Pardalos, P. M., andRosen, J. B.,Methods for Global Concave Minimization: A Bibliographic Survey, SIAM Review, Vol. 28, 367–379, 1986.

    Google Scholar 

  12. Pardalos, P. M., andRosen, J. B.,Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science 268, Springer, Berlin, Germany, 1987.

    Google Scholar 

  13. Horst, R.,A General Class of Branch-and-Bound Methods in Global Optimization with Some New Approaches for Concave Minimization, Journal of Optimization Theory and Applications, Vol. 51, pp. 271–291, 1986.

    Google Scholar 

  14. Soland, R. M.,An Algorithm for Separable Nonconvex Programming Problems, II: Nonconvex Constraints, Management Science, Vol. 17, pp. 759–773, 1971.

    Google Scholar 

  15. Horst, R., andDien, L. V.,Minimizing a DC Function Subject to Convex and Reverse Convex Constraints, Preprint, University of Trier, Trier, Germany, 1987.

    Google Scholar 

  16. Tuy, H., andHorst, R.,Convergence and Restart in Branch-and-Bound Algorithms for Global Optimization. Applications to Concave Minimization and DC Optimization Problems, Mathematical Programming (to appear).

  17. Horst, R., andTuy, H.,On the Convergence of Global Methods in Multiextremal Optimization, Journal of Optimization Theory and Applications, Vol. 54, pp. 253–271, 1987.

    Google Scholar 

  18. Tuy, H.,Concave Programming under Linear Constraints, Soviet Mathematics, Vol. 5, pp. 1437–1440, 1964.

    Google Scholar 

  19. Zwart, P. B.,Nonlinear Programming: Counterexamples to Global Optimization Algorithms by Ritter and Tuy, Operations Research, Vol. 21, pp. 1260–1266, 1973.

    Google Scholar 

  20. Zwart, P. B.,Global Maximization of a Convex Function with Linear Inequality Constraints, Operations Research, Vol. 22, pp. 602–609, 1974.

    Google Scholar 

  21. Jacobsen, S. E.,Convergence of a Tuy-Type Algorithm for Concave Minimization Subject to Linear Constraints, Applied Mathematics and Optimization, Vol. 7, pp. 1–9, 1981.

    Google Scholar 

  22. Tuy, H.,On Polyhedral Annexation Method for Concave Minimization, Preprint, Institute of Mathematics, Hanoi, Vietnam, 1987.

    Google Scholar 

  23. Pintèr, J..,Globally Convergent Methods for n-Dimensional Multiextremal Optimization, Optimization, Vol. 17, pp. 187–202, 1986.

    Google Scholar 

  24. Pintèr, J.,Extended Univariate Algorithms for n-Dimensional Global Optimization, Computing, Vol. 36, pp. 91–103, 1986.

    Google Scholar 

  25. Pintèr, J.,Branch-and-Bound Algorithms for Solving Multiextremal Mathematical Programming Problems with Lipschitzian Structure, Working Paper, VITUKI, Budapest, Hungary, 1987.

    Google Scholar 

  26. Fedorov, V. V., Editor,Problems of Cybernetics. Models and Methods in Global Optimization, USSR Academy of Sciences, Moscow, USSR, 1985 (in Russian).

    Google Scholar 

  27. Strongin, R. G.,Numerical Methods for Multiextremal Problems, Nauka, Moscow, USSR, 1978 (in Russian).

    Google Scholar 

  28. Strongin, R. G.,Numerical Methods for Multiextremal Nonlinear Programming Problems with Nonconvex Constraints, Nondifferentiable Optimization: Motivations and Applications, Proceedings of IIASA Workshop, Sopron, Hungary, 1984; Edited by V. F. Demyanov and D. Pallaschke, IIASA, Laxenburg, Austria, 1984.

    Google Scholar 

  29. Zilinskas, A.,Axiomatic Characterization of a Global Optimization Algorithm and Investigations of its Search Strategy, Operations Research Letters, Vol. 4, pp. 35–39, 1985.

    Google Scholar 

  30. Galperin, E. A.,The Cubic Algorithm, Journal of Mathematical Analysis and Applications, Vol. 112, pp. 635–640, 1985.

    Google Scholar 

  31. Pijavskii, S. A.,An Algorithm for Finding the Absolute Extremum of a Function, USSR Computational Mathematics and Mathematical Physics, Vol. 12, pp. 57–67, 1972.

    Google Scholar 

  32. Shubert, B. O.,A Sequential Method Seeking the Global Maximum of a Function, SIAM Journal on Numerical Analysis, Vol. 9, pp. 379–388, 1972.

    Google Scholar 

  33. Mladineo, R. H.,An Algorithm for Finding the Global Maximum of a Multimodal, Multivariate Function, Mathematical Programming, Vol. 34, 188–200, 1986.

    Google Scholar 

  34. Galperin, E. A.,The Beta Algorithms for Mathematical Programming, Proceedings of the 1986 Conference on Information Sciences and Systems, Department of Electrical Engineering, Princeton University, Princeton, New Jersey, pp. 318–320, 1986.

    Google Scholar 

  35. Horst, R.,On Solving Lipschitzian Global Optimization Problems, Acta Mathematica Vietnamica (to appear).

  36. Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  37. Tuy, H., Khatchaturov, V., andUtkin, S.,A Class of Exhaustive Cone Splitting Procedures in Conical Algorithms for Concave Minimization, Optimization (to appear).

Download references

Author information

Authors and Affiliations

  1. Fachbereich IV-Mathematik, Universität Trier, Trier, West Germany

    R. Horst (Professor)

Authors
  1. R. Horst
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by G. Leitmann

Rights and permissions

Reprints and permissions

About this article

Cite this article

Horst, R. Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization. J Optim Theory Appl 58, 11–37 (1988). https://doi.org/10.1007/BF00939768

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00939768

Key Words

Search

Navigation