Skip to main content
SpringerLink
Log in

Finite Convergence of the Partial Inverse Algorithm

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. LEFEBVRE, O., and MICHELOT, C., Calcul d'un Point Fixe d'une Application Prox par la Méthode des Approximations Successives: Conditions de Convergence Finie, Compte Rendus de l'Académie des Sciences, Vol. 303, pp. 905–908, 1986.

    Google Scholar 

  2. LEFEBVRE, O., and MICHELOT, C., About the Finite Convergence of the Proximal Point Algorithm, Edited by K. H. Hoffman, J. B. Hiriart-Hurruty, C. Lemarechal, and J. Zowe, International Series of Numerical Mathematics, Birkhauser Verlag, Basel, Switzerland, Vol. 84, pp. 153–161, 1988.

    Google Scholar 

  3. LAWRENCE, J., and SPINGARN, J. E., On Fixed Points of Nonexpansive Piecewise Isometric Mappings, Proceedings of the London Mathematical Society, Vol. 55, pp. 605–624, 1987.

    Google Scholar 

  4. MICHELOT, C., and LEFEBVRE, O., A Primal-Dual Algorithm for the Fermat-Weber Problem Involving Mixed Gauges, Mathematical Programming, Vol. 29, pp. 319–335, 1987.

    Google Scholar 

  5. SPINGARN, J. E., Partial Inverse of a Monotone Operator, Applied Mathematics and Optimization. Vol. 10, pp. 247–265, 1983.

    Google Scholar 

  6. SPINGARN, J. E., A Primal-Dual Projection Method for Solving Systems of Linear Inequalities, Linear Algebra and Its Applications, Vol. 65, pp. 45–62, 1985.

    Google Scholar 

  7. DURIER, R., On Locally Polyhedral Convex Functions, Edited by K. H. Hoffman, J. B. Hiriart-Hurruty, C. Lemarechal, and J. Zowe, International Series of Numerical Mathematics, Birkhauser Verlag, Basel, Switzerland, Vol. 84, pp. 55–66, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de Mathématiques et d'Informatique, École Supérieure des Sciences et Techniques de Tunis, Tunis, Tunisie

    M. Daldoul (Maître-Assistant)

Authors
  1. M. Daldoul
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daldoul, M. Finite Convergence of the Partial Inverse Algorithm. Journal of Optimization Theory and Applications 95, 693–699 (1997). https://doi.org/10.1023/A:1022634208371

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022634208371

Search

Navigation