Abstract
In this paper, we refine the proof of convergence by Kuno–Buckland (J Global Optim 52:371–390, 2012) for the simplicial algorithm with \(\omega \)-subdivision and generalize their \(\omega \)-bisection rule to establish a class of subdivision rules, called \(\omega \)-k-section, which bounds the number of subsimplices generated in a single execution of subdivision by a prescribed number k. We also report some numerical results of comparing the \(\omega \)-k-section rule with the usual \(\omega \)-subdivision rule.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
GNU Octave: http://www.gnu.org/software/octave/
Horst, R.: An algorithm for nonconvex programming problems. Math. Program. 10, 312–321 (1976)
Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Springer, Berlin (1995)
Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)
Jaumard, B., Meyer, C.: A simplified convergence proof for the cone partitioning algorithm. J. Global. Optim. 13, 407–416 (1998)
Jaumard, B., Meyer, C.: On the convergence of cone splitting algorithms with \(\omega \)-subdivisions. J. Optim. Theory Appl. 110, 119–144 (2001)
Kuno, T., Buckland, P.E.K.: A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies. J. Global. Optim. 52, 371–390 (2012)
Kuno, T., Ishihama, T.: A convergent conical algorithm with \(\omega \)-bisection for concave minimization. J. Global. Optim. 61, 203–220 (2015)
Locatelli, M.: Finiteness of conical algorithm with \(\omega \)-subdivisions. Math. Program. A 85, 593–616 (1999)
Locatelli, M., Raber, U.: On convergence of the simplicial branch-and-bound algorithm based on \(\omega \)-subdivisions. J. Optim. Theory Appl. 107, 69–79 (2000)
Locatelli, M., Raber, U.: Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega \)-subdivisions. J. Optim. Theory Appl. 107, 81–88 (2000)
Locatelli, M., Schoen, F.: Global Optimization: Theory, Algorithms, and Applications. SIAM, Philadelphia (2013)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Thoai, N.V., Tuy, H.: Convergent algorithms for minimizing a concave function. Math. Oper. Res. 5, 556–566 (1980)
Tuy, H.: Concave programming under linear constraints. Soviet Math. 5, 1437–1440 (1964)
Tuy, H.: Normal conical algorithm for concave minimization over polytopes. Math. Program. 51, 229–245 (1991)
Tuy, H.: Convex Analysis and Global Optimization. Springer, Berlin (1998)
Acknowledgments
The authors would like to thank the anonymous referees for their valuable comments, which significantly improved the quality of this article. Takahito Kuno was partially supported by a Grant-in-Aid for Scientific Research (C) 25330022 from the Japan Society for the Promotion of Sciences
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kuno, T., Ishihama, T. A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm. Comput Optim Appl 64, 535–555 (2016). https://doi.org/10.1007/s10589-015-9817-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-015-9817-6