Skip to main content
Log in

Penalization in non-classical convex programming via variational convergence

  • Published:
Mathematical Programming Submit manuscript

Abstract

A penalty method for convex functions which cannot necessarily be extended outside their effective domains by an everywhere finite convex function is proposed and combined with the proximal method. Proofs of convergence rely on variational convergence theory.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P. Alart, “Contribution à la résolution numérique des inclusions différentielles,” Thèse de 3ème cycle, Université des Sciences et Techniques du Languedoc (Montpellier, 1985).

    Google Scholar 

  2. H. Attouch,Variational Convergence for Functions and Operators (Pitman Advance Publishing Program, Boston, MA, 1984).

    Google Scholar 

  3. H. Attouch and R.J.B. Wets, “Isometries for the Legendre—Fenchel transform,”Transactions of the American Mathematical Society 296 (1984) 33–60.

    Google Scholar 

  4. A. Auslender, “Numerical methods for non differentiable convex optimization,”Mathematical Programming Studies 30 (1985).

  5. A. Auslender, J.P. Crouzeix and P. Fedit, “Penalty proximal methods in Convex Programming,”Journal of Optimization Theory and Applications (to appear).

  6. N. Bourbaki,Espaces Vectoriels Topologiques (Hermann, Paris) p. 129.

  7. P.J. Laurent,Approximation et Optimisation (Hermann, Paris, 1972).

    Google Scholar 

  8. B. Lemaire, “Approximations successives pour certains problèmes périodiques,” Séminaire d'Analyse Convexe, exposé no. 21 (Montpellier, 1977).

  9. B. Lemaire, “Coupling optimization methods and variational convergence,” in:Trends in Mathematical Optimization, International Series of Numerical Mathematics (Birkhäuser, Basel, 1988) pp. 163–179.

    Google Scholar 

  10. B. Martinet, “Algorithmes pour la résolution de problèmes d'optimisation et de minimax,” Thèse d'Etat, Université de Grenoble (Grenoble, 1972).

    Google Scholar 

  11. B. Martinet, “Perturbation des méthodes d'optimisation,”Revue d'Automatique Informatique et Recherche Opérationnelle, Analyse Numérique 12(2) (1978) 153–171.

    Google Scholar 

  12. J.J. Moreau, “Proximité et dualité dans un espace hilbertien,”Bulletin de la Société Mathématique de France 93 (1965) 273–299.

    Google Scholar 

  13. K. Mouallif, “Sur la convergence d'une méthode associant pénalisation et régularisation,”Bulletin de la Société Royale des Sciences de Liège, 56è année 2 (1987) 175–180.

    Google Scholar 

  14. K. Mouallif and P. Tossings, “Une méthode de pénalisation exponentielle associée à une régularisation proximale,”Bulletin de la Société Royale des Sciences de Liège, 56è année 2 (1987) 181–190.

    Google Scholar 

  15. R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970).

    Google Scholar 

  16. R.T. Rockafellar, “Monotone operators and the proximal point algorithm,”SIAM Journal on Control and Optimization 14 (1976) 877–808.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alart, P., Lemaire, B. Penalization in non-classical convex programming via variational convergence. Mathematical Programming 51, 307–331 (1991). https://doi.org/10.1007/BF01586942

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01586942

Key words

Navigation