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

On a continuous approach for the maximum weighted clique problem

Author

Listed:
  • Tatyana Gruzdeva

Abstract

This paper is focused on computational study of continuous approach for the maximum weighted clique problem. The problem is formulated as a continuous optimization problem with a nonconvex quadratic constraint given by the difference of two convex functions (d.c. function). The proposed approach consists of two main ingredients: a local search algorithm, which provides us with crucial points; and a procedure which is based on global optimality condition and which allows us to escape from such points. The efficiency of the proposed algorithm is illustrated by computational results. Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • Tatyana Gruzdeva, 2013. "On a continuous approach for the maximum weighted clique problem," Journal of Global Optimization, Springer, vol. 56(3), pages 971-981, July.
    • Handle: RePEc:spr:jglopt:v:56:y:2013:i:3:p:971-981
    DOI: 10.1007/s10898-012-9885-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-9885-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-9885-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. Immanuel Bomze & Luigi Grippo & Laura Palagi, 2012. "Unconstrained formulation of standard quadratic optimization problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 35-51, April.
    2. Rafael Blanquero & Emilio Carrizosa, 2010. "On the norm of a dc function," Journal of Global Optimization, Springer, vol. 48(2), pages 209-213, October.
    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. Immanuel Bomze & Chen Ling & Liqun Qi & Xinzhen Zhang, 2012. "Standard bi-quadratic optimization problems and unconstrained polynomial reformulations," Journal of Global Optimization, Springer, vol. 52(4), pages 663-687, April.
    2. Wang, Xing & Tao, Chang-qi & Tang, Guo-ji, 2015. "A class of differential quadratic programming problems," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 369-377.
    3. Dellepiane, Umberto & Palagi, Laura, 2015. "Using SVM to combine global heuristics for the Standard Quadratic Problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 596-605.
    4. Hoai An Le Thi & Vinh Thanh Ho & Tao Pham Dinh, 2019. "A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning," Journal of Global Optimization, Springer, vol. 73(2), pages 279-310, February.
    5. Riccardo Bisori & Matteo Lapucci & Marco Sciandrone, 2022. "A study on sequential minimal optimization methods for standard quadratic problems," 4OR, Springer, vol. 20(4), pages 685-712, December.
    6. Blanquero, R. & Carrizosa, E. & Hendrix, E.M.T., 2011. "Locating a competitive facility in the plane with a robustness criterion," European Journal of Operational Research, Elsevier, vol. 215(1), pages 21-24, November.

    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:56:y:2013:i:3:p:971-981. 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.