IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v16y2008i2p139-152.html
   My bibliography  Save this article

A computational comparison of some branch and bound methods for indefinite quadratic programs

Author

Listed:
  • Riccardo Cambini
  • Claudio Sodini

Abstract

The aim of this paper is to discuss different branch and bound methods for solving indefinite quadratic programs. In these methods the quadratic objective function is decomposed in a d.c. form and the relaxations are obtained by linearizing the concave part of the decomposition. In this light, various decomposition schemes have been considered and studied. The various branch and bound solution methods have been implemented and compared by means of a deep computational test. Copyright Springer-Verlag 2008

Suggested Citation

  • Riccardo Cambini & Claudio Sodini, 2008. "A computational comparison of some branch and bound methods for indefinite quadratic programs," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(2), pages 139-152, June.
    • Handle: RePEc:spr:cejnor:v:16:y:2008:i:2:p:139-152
    DOI: 10.1007/s10100-007-0049-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-007-0049-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-007-0049-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. Pierre Hansen & Brigitte Jaumard & MichèLe Ruiz & Junjie Xiong, 1993. "Global minimization of indefinite quadratic functions subject to box constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 373-392, April.
    2. Nguyen Thoai, 2005. "General Quadratic Programming," Springer Books, in: Charles Audet & Pierre Hansen & Gilles Savard (ed.), Essays and Surveys in Global Optimization, chapter 0, pages 107-129, Springer.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Balázs Bánhelyi & Endre Palatinus & Balázs Lévai, 2015. "Optimal circle covering problems and their applications," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 815-832, December.
    2. R. Cambini & R. Riccardi & D. Scopelliti, 2023. "Solving linear multiplicative programs via branch-and-bound: a computational experience," Computational Management Science, Springer, vol. 20(1), pages 1-32, December.

    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. Samuel Burer & Dieter Vandenbussche, 2009. "Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound," Computational Optimization and Applications, Springer, vol. 43(2), pages 181-195, June.
    2. Wei Xia & Juan C. Vera & Luis F. Zuluaga, 2020. "Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 40-56, January.
    3. Benjamin Beach & Robert Hildebrand & Joey Huchette, 2022. "Compact mixed-integer programming formulations in quadratic optimization," Journal of Global Optimization, Springer, vol. 84(4), pages 869-912, December.
    4. Yash Puranik & Nikolaos V. Sahinidis, 2017. "Bounds tightening based on optimality conditions for nonconvex box-constrained optimization," Journal of Global Optimization, Springer, vol. 67(1), pages 59-77, January.

    More about this item

    Keywords

    Quadratic programming; Branch and bound; d.c. decomposition; 90C20; 90C26; 90C31; C61; C63;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    Statistics

    Access and download statistics

    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:cejnor:v:16:y:2008:i:2:p:139-152. 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.