IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v92y1997i2d10.1023_a1022655129695.html
   My bibliography  Save this article

Self-Tuning Norm-Relaxed Method of Feasible Directions

Author

Listed:
  • J. Korycki

    (Clemson University)

  • M. Kostreva

    (Clemson University)

Abstract

This paper presents three updating techniques for the scaling matrix or the scalar weight used in the norm-relaxed method of feasible directions, a generalization of the popular Pironneau–Polak algorithm. These techniques include variable metric updates and tuning of a scalar weight in a way characteristic of trust-region methods, and also techniques based on the idea of multiple directions, where the update decision is made by comparing results of searching along several directions determined by distinct values of weights. Numerical results obtained on a standard test set are provided. These results indicate that the updating techniques allow considerable computational savings when compared with the original Pironneau-Polak method.

Suggested Citation

  • J. Korycki & M. Kostreva, 1997. "Self-Tuning Norm-Relaxed Method of Feasible Directions," Journal of Optimization Theory and Applications, Springer, vol. 92(2), pages 311-330, February.
    • Handle: RePEc:spr:joptap:v:92:y:1997:i:2:d:10.1023_a:1022655129695
    DOI: 10.1023/A:1022655129695
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022655129695
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1022655129695?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.

    Citations

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


    Cited by:

    1. X. B. Chen & M. M. Kostreva, 1999. "Global Convergence Analysis of Algorithms for Finding Feasible Points in Norm-Relaxed MFD," Journal of Optimization Theory and Applications, Springer, vol. 100(2), pages 287-309, February.

    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:joptap:v:92:y:1997:i:2:d:10.1023_a:1022655129695. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.