IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v166y2009i1p183-20110.1007-s10479-008-0425-z.html
   My bibliography  Save this article

Improving directions of negative curvature in an efficient manner

Author

Listed:
  • Alberto Olivares
  • Javier Moguerza

Abstract

In order to converge to second-order KKT points, second derivative information has to be taken into account. Therefore, methods for minimization satisfying convergence to second-order KKT points must, at least implicitly, compute a direction of negative curvature of an indefinite matrix. An important issue is to determine the quality of the negative curvature direction. This problem is closely related to the symmetric eigenvalue problem. More specifically we want to develop algorithms that improve directions of negative curvature with relatively little effort, extending the proposals by Boman and Murray. This paper presents some technical improvements with respect to their work. In particular, we study how to compute “good” directions of negative curvature. In this regard, we propose a new method and we present numerical experiments that illustrate its practical efficiency compared to other proposals. Copyright Springer Science+Business Media, LLC 2009

Suggested Citation

  • Alberto Olivares & Javier Moguerza, 2009. "Improving directions of negative curvature in an efficient manner," Annals of Operations Research, Springer, vol. 166(1), pages 183-201, February.
    • Handle: RePEc:spr:annopr:v:166:y:2009:i:1:p:183-201:10.1007/s10479-008-0425-z
    DOI: 10.1007/s10479-008-0425-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-008-0425-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-008-0425-z?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. Olivares, Alberto & Moguerza, Javier M. & Prieto, Francisco J., 2008. "Nonconvex optimization using negative curvature within a modified linesearch," European Journal of Operational Research, Elsevier, vol. 189(3), pages 706-722, September.
    2. Sun, Jie & Yang, Xiaoqi & Chen, Xiongda, 2005. "Quadratic cost flow and the conjugate gradient method," European Journal of Operational Research, Elsevier, vol. 164(1), pages 104-114, July.
    3. S. Sanmatías & E. Vercher, 1998. "A Generalized Conjugate Gradient Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 98(2), pages 489-502, August.
    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. Javier Cano & Javier M. Moguerza & Francisco J. Prieto, 2017. "Using Improved Directions of Negative Curvature for the Solution of Bound-Constrained Nonconvex Problems," Journal of Optimization Theory and Applications, Springer, vol. 174(2), pages 474-499, August.

    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. Javier Cano & Javier M. Moguerza & Francisco J. Prieto, 2017. "Using Improved Directions of Negative Curvature for the Solution of Bound-Constrained Nonconvex Problems," Journal of Optimization Theory and Applications, Springer, vol. 174(2), pages 474-499, August.
    2. Olivares, Alberto & Moguerza, Javier M. & Prieto, Francisco J., 2008. "Nonconvex optimization using negative curvature within a modified linesearch," European Journal of Operational Research, Elsevier, vol. 189(3), pages 706-722, September.
    3. Battauz, Michela & Vidoni, Paolo, 2022. "A likelihood-based boosting algorithm for factor analysis models with binary data," Computational Statistics & Data Analysis, Elsevier, vol. 168(C).
    4. Shi, Zhen-Jun & Shen, Jie, 2007. "Convergence of Liu-Storey conjugate gradient method," European Journal of Operational Research, Elsevier, vol. 182(2), pages 552-560, October.

    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:annopr:v:166:y:2009:i:1:p:183-201:10.1007/s10479-008-0425-z. 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.