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

Finite Convergence of the Partial Inverse Algorithm

Author

Listed:
  • M. Daldoul

    (École Supérieure des Sciences et Techniques de Tunis)

Abstract

In Refs. 1–2, Lefebvre and Michelot proved the finite convergence of the partial inverse algorithm applied to a polyhedral convex function by means of some suitable tools of convex analysis. They obtained their result under some assumptions on the primal and dual solution sets. The aim of this note is to show that the proof can be extended to remove the nasty assumption on the dual solution set. The result is in conformity with the proof given in Ref. 3, which has been obtained using the concept of folding.

Suggested Citation

  • M. Daldoul, 1997. "Finite Convergence of the Partial Inverse Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 95(3), pages 693-699, December.
    • Handle: RePEc:spr:joptap:v:95:y:1997:i:3:d:10.1023_a:1022634208371
    DOI: 10.1023/A:1022634208371
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022634208371
    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:1022634208371?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.

    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:95:y:1997:i:3:d:10.1023_a:1022634208371. 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.