IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v52y2012i3p411-421.html
   My bibliography  Save this article

On the relation between concavity cuts and the surrogate dual for convex maximization problems

Author

Listed:
  • Marco Locatelli
  • Fabio Schoen

Abstract

No abstract is available for this item.

Suggested Citation

  • Marco Locatelli & Fabio Schoen, 2012. "On the relation between concavity cuts and the surrogate dual for convex maximization problems," Journal of Global Optimization, Springer, vol. 52(3), pages 411-421, March.
    • Handle: RePEc:spr:jglopt:v:52:y:2012:i:3:p:411-421
    DOI: 10.1007/s10898-011-9748-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-011-9748-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-011-9748-4?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. M. Dür & R. Horst, 1997. "Lagrange Duality and Partitioning Techniques in Nonconvex Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 95(2), pages 347-369, November.
    2. M. Hamami & S. E. Jacobsen, 1988. "Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes," Mathematics of Operations Research, INFORMS, vol. 13(3), pages 479-487, August.
    3. Reiner Horst & Nguyen Thoai, 2005. "Duality Bound Methods in Global Optimization," Springer Books, in: Charles Audet & Pierre Hansen & Gilles Savard (ed.), Essays and Surveys in Global Optimization, chapter 0, pages 79-105, Springer.
    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. 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.
    2. Yankai Cao & Victor M. Zavala, 2019. "A scalable global optimization algorithm for stochastic nonlinear programs," Journal of Global Optimization, Springer, vol. 75(2), pages 393-416, October.
    3. Moslem Zamani, 2019. "A new algorithm for concave quadratic programming," Journal of Global Optimization, Springer, vol. 75(3), pages 655-681, November.
    4. 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.
    5. Vasilios I. Manousiouthakis & Neil Thomas & Ahmad M. Justanieah, 2011. "On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope," Journal of Optimization Theory and Applications, Springer, vol. 151(1), pages 121-134, October.
    6. Charles Audet & Jack Brimberg & Pierre Hansen & Sébastien Le Digabel & Nenad Mladenovi'{c}, 2004. "Pooling Problem: Alternate Formulations and Solution Methods," Management Science, INFORMS, vol. 50(6), pages 761-776, June.
    7. Benson, Harold P., 2007. "A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 597-611, October.
    8. Rohit Kannan & Paul I. Barton, 2018. "Convergence-order analysis of branch-and-bound algorithms for constrained problems," Journal of Global Optimization, Springer, vol. 71(4), pages 753-813, August.
    9. N.V. Thoai, 2002. "Convergence and Application of a Decomposition Method Using Duality Bounds for Nonconvex Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 113(1), pages 165-193, April.

    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:jglopt:v:52:y:2012:i:3:p:411-421. 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.