IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v161y2005i3p655-662.html
   My bibliography  Save this article

A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming

Author

Listed:
  • Gomez, Manuel A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Gomez, Manuel A., 2005. "A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming," European Journal of Operational Research, Elsevier, vol. 161(3), pages 655-662, March.
    • Handle: RePEc:eee:ejores:v:161:y:2005:i:3:p:655-662
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00677-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Gomez, Manuel A. & Pedreira, Luis P., 2002. "Constraint deletion strategy in the inertia-controlling quadratic programming method," European Journal of Operational Research, Elsevier, vol. 139(2), pages 193-205, June.
    2. Le Thi Hoai An & Pham Dinh Tao & Le Dung Muu, 1998. "A Combined D.C. Optimization—Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems," Journal of Combinatorial Optimization, Springer, vol. 2(1), pages 9-28, March.
    3. Ben-Daya, M. & Al-Sultan, K. S., 1997. "A new penalty function algorithm for convex quadratic programming," European Journal of Operational Research, Elsevier, vol. 101(1), pages 155-163, August.
    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. X. J. Zheng & X. L. Sun & D. Li, 2010. "Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 463-489, August.
    2. Marcia Fampa & Jon Lee & Wendel Melo, 2017. "On global optimization with indefinite quadratics," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 309-337, September.
    3. David Wozabal, 2012. "A framework for optimization under ambiguity," Annals of Operations Research, Springer, vol. 193(1), pages 21-47, March.
    4. Da Tian, 2015. "An exterior point polynomial-time algorithm for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 61(1), pages 51-78, May.
    5. X. Zheng & X. Sun & D. Li, 2011. "Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations," Journal of Global Optimization, Springer, vol. 50(4), pages 695-712, August.

    More about this item

    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:eee:ejores:v:161:y:2005:i:3:p:655-662. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.