Skip to main content
SpringerLink
Log in

Methodes Duales pour le Calcul du Minimum d'une Fonction Convexe sur une Intersection de Convexes

  • Conference paper
  • First Online:
Symposium on Optimization

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 132))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Haugazeau, Y., — Sur la minimisation de formes quadratiques avec contraintes. C.R. Acad. Sci. Paris, 264, (1967), 322–324.

    MathSciNet  MATH  Google Scholar 

  2. Haugazeau, Y., — Sur les inéquations variationnelles et la minimisation de fonctionnelles convexes. Thèse, Paris, 7 juin 1967.

    Google Scholar 

  3. Kaplan A.A., — Determination of the extremum of a linear function on a convex set. Soviet mathematics, 9, (1968), 269–271.

    MATH  Google Scholar 

  4. Kelley J.E., — The cutting plane method for solving convex programs. J. S.I.A.M., 6, (1958), 15–22.

    MathSciNet  Google Scholar 

  5. Laurent P.J., — Construction of spline functions in a convex set. Symposium on Approximations, Madison, University of Wisconsin, May 5–7, (1969).

    Google Scholar 

  6. Laurent P.J., — Cours de théorie de l'approximation, fascicule 5, Grenoble (1968–69).

    Google Scholar 

  7. Levitin E.S. et B.T. Polyak — Constrained minimization methods. USSR Comp. math. and phys. Math., 6 (1966), 1–50.

    Article  Google Scholar 

  8. Lions J.L. et R. Teman, — Une méthode d'éclatement des opérateuns et des contraintes en calcul des variations. C.R. Acad. Sci. Paris, 263, (1966), 563–565.

    MATH  Google Scholar 

  9. Moreau J.J., — Fonctionnelles convexes. Séminaire sur les équations aux dérivées partielles. Collège de France, (1966–67).

    Google Scholar 

  10. Morin M., — Méthodes de calcul des fonctions-spline dans un convexe. Thèse, Grenoble (1969).

    Google Scholar 

  11. Zoutendijk G., — Non linear programming, a numerical survey. Journal SIAM Control 4, (1966), 194–210.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Grenoble Mathématiques Appliquées, Cedex 53, F-38, Grenoble-Gare

    P. J. Laurent

  2. Centre d'Etudes Nucléaires de Grenoble, Oedex 85, F-38, Grenoble-Gare

    B. Martinet

Authors
  1. P. J. Laurent
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Martinet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. V. Balakrishnan M. Contensou B. F. de Veubeke P. Krée J. L. Lions N. N. Moiseev

Rights and permissions

Reprints and permissions

Copyright information

© 1970 Springer-Verlag

About this paper

Cite this paper

Laurent, P.J., Martinet, B. (1970). Methodes Duales pour le Calcul du Minimum d'une Fonction Convexe sur une Intersection de Convexes. In: Balakrishnan, A.V., Contensou, M., de Veubeke, B.F., Krée, P., Lions, J.L., Moiseev, N.N. (eds) Symposium on Optimization. Lecture Notes in Mathematics, vol 132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066681

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04921-0

  • Online ISBN: 978-3-540-36275-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation