IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v110y2001i1d10.1023_a1017595513275.html
   My bibliography  Save this article

On the Convergence of Cone Splitting Algorithms with ω-Subdivisions

Author

Listed:
  • B. Jaumard

    (GERAD and École Polytechnique de Montréal)

  • C. Meyer

    (École Polytechnique de Montréal)

Abstract

We present a convergence proof of the Tuy cone splitting algorithm with a pure ω-subdivision strategy for the minimization of a concave function over a polytope. The key idea of the convergence proof is to associate with the current hyperplane a new hyperplane that supports the whole polytope instead of only the portion of it contained in the current cone. A branch-and-bound variant of the algorithm is also discussed.

Suggested Citation

  • B. Jaumard & C. Meyer, 2001. "On the Convergence of Cone Splitting Algorithms with ω-Subdivisions," Journal of Optimization Theory and Applications, Springer, vol. 110(1), pages 119-144, July.
    • Handle: RePEc:spr:joptap:v:110:y:2001:i:1:d:10.1023_a:1017595513275
    DOI: 10.1023/A:1017595513275
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1017595513275
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1017595513275?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Philip B. Zwart, 1974. "Global Maximization of a Convex Function with Linear Inequality Constraints," Operations Research, INFORMS, vol. 22(3), pages 602-609, June.
    2. Nguyen Van Thoai & Hoang Tuy, 1980. "Convergent Algorithms for Minimizing a Concave Function," Mathematics of Operations Research, INFORMS, vol. 5(4), pages 556-566, November.
    3. Philip B. Zwart, 1973. "Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms," Operations Research, INFORMS, vol. 21(6), pages 1260-1266, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ankhili, Z. & Mansouri, A., 2009. "An exact penalty on bilevel programs with linear vector optimization lower level," European Journal of Operational Research, Elsevier, vol. 197(1), pages 36-41, August.
    2. N. V. Thoai, 2000. "Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints," Journal of Optimization Theory and Applications, Springer, vol. 107(2), pages 331-354, November.
    3. Collet, J.H., 1983. "Use of temperature-green functions for calculations of second-order susceptibilities," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 121(1), pages 85-91.
    4. Takahito Kuno & Tomohiro Ishihama, 2016. "A generalization of $$\omega $$ ω -subdivision ensuring convergence of the simplicial algorithm," Computational Optimization and Applications, Springer, vol. 64(2), pages 535-555, June.
    5. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
    6. Jonathan Eckstein & Mikhail Nediak, 2005. "Depth-Optimized Convexity Cuts," Annals of Operations Research, Springer, vol. 139(1), pages 95-129, October.
    7. Aharon Ben-Tal & Ernst Roos, 2022. "An Algorithm for Maximizing a Convex Function Based on Its Minimum," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3200-3214, November.
    8. Harold P. Benson, 1996. "Deterministic algorithms for constrained concave minimization: A unified critical survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 765-795, September.
    9. Queiroz, Marcelo & Humes, Carlos, 2003. "A heuristic for the continuous capacity and flow assignment," European Journal of Operational Research, Elsevier, vol. 146(3), pages 444-459, May.
    10. N. V. Thoai, 2010. "Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets," Journal of Optimization Theory and Applications, Springer, vol. 147(2), pages 263-277, November.
    11. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    12. N. V. Thoai & Y. Yamamoto & A. Yoshise, 2005. "Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints," Journal of Optimization Theory and Applications, Springer, vol. 124(2), pages 467-490, February.
    13. Aras Selvi & Aharon Ben-Tal & Ruud Brekelmans & Dick den Hertog, 2022. "Convex Maximization via Adjustable Robust Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2091-2105, July.
    14. G. Pacelli & M. C. Recchioni, 2000. "Monotone Variable–Metric Algorithm for Linearly Constrained Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 104(2), pages 255-279, February.
    15. Pooriya Beyhaghi & Thomas R. Bewley, 2016. "Delaunay-based derivative-free optimization via global surrogates, part II: convex constraints," Journal of Global Optimization, Springer, vol. 66(3), pages 383-415, November.
    16. R. Horst & N. V. Thoai, 1999. "DC Programming: Overview," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 1-43, October.
    17. Roos, Ernst, 2021. "Robust approaches for optimization problems with convex uncertainty," Other publications TiSEM dd9e7b35-a770-4f8d-a85c-8, Tilburg University, School of Economics and Management.
    18. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems (revised as on 12/08/2021)," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:110:y:2001:i:1:d:10.1023_a:1017595513275. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.