(en) Constantin Zălinescu, Convex analysis in general vector spaces, River Edge, NJ, World Scientific PublishingCo.,Inc., , 106–113 p. (ISBN981-238-067-1, MR1921556), « J »
(en) Jean-Baptiste Hiriart-Urruty et Claude Lemaréchal, Convex Analysis and Minimization Algorithms II : Advanced Theory and Bundle Methods, vol. 306, Berlin, Springer-Verlag, , xviii+346 (ISBN3-540-56852-2, MR1295240, lire en ligne)
Leon S. Lasdon, Optimization theory for large systems, Mineola, New York, Dover Publications, Inc., (1re éd. Reprint of the 1970 Macmillan), xiii+523 (ISBN978-0-486-41999-2, MR1888251, lire en ligne)
(en) Claude Lemaréchal, Computational combinatorial optimization: Papers from the Spring School held in Schloß Dagstuhl, May 15–19, 2000, vol. 2241, Berlin, Springer-Verlag, coll. « Lecture Notes in Computer Science (LNCS) », , 112–156 p. (ISBN3-540-42877-1, DOI10.1007/3-540-45586-8_4, MR1900016), « Lagrangian relaxation »
(en) Michel Minoux (Egon Balas (forward); Steven Vajda (trans) from the (1983 Paris: Dunod) French), Mathematical programming : Theory and algorithms, Chichester, A Wiley-Interscience Publication. John Wiley & Sons, Ltd., , xxviii+489 (ISBN0-471-90170-9, MR868279)
Jeremy F. Shapiro, Mathematical programming : Structures and algorithms, New York, Wiley-Interscience John Wiley & Sons, , xvi+388 (ISBN0-471-77886-9, MR544669)
books.google.com
(en) Ernö Robert Csetnek, Overcoming the failure of the classical generalized interior-point regularity conditions in convex optimization. Applications of the duality theory to enlargements of maximal monotone operators, Logos Verlag Berlin GmbH, , 110 p. (ISBN978-3-8325-2503-3, lire en ligne)
(en) Jean-Baptiste Hiriart-Urruty et Claude Lemaréchal, Convex Analysis and Minimization Algorithms II : Advanced Theory and Bundle Methods, vol. 306, Berlin, Springer-Verlag, , xviii+346 (ISBN3-540-56852-2, MR1295240, lire en ligne)
Leon S. Lasdon, Optimization theory for large systems, Mineola, New York, Dover Publications, Inc., (1re éd. Reprint of the 1970 Macmillan), xiii+523 (ISBN978-0-486-41999-2, MR1888251, lire en ligne)
(en) Claude Lemaréchal, Computational combinatorial optimization: Papers from the Spring School held in Schloß Dagstuhl, May 15–19, 2000, vol. 2241, Berlin, Springer-Verlag, coll. « Lecture Notes in Computer Science (LNCS) », , 112–156 p. (ISBN3-540-42877-1, DOI10.1007/3-540-45586-8_4, MR1900016), « Lagrangian relaxation »
Arthur M. Geoffrion, « Duality in Nonlinear Programming: A Simplified Applications-Oriented Development », SIAM Review, vol. 13, no 1, , p. 1–37 (DOI10.1137/1013001, JSTOR2028848)
jstor.org
Arthur M. Geoffrion, « Duality in Nonlinear Programming: A Simplified Applications-Oriented Development », SIAM Review, vol. 13, no 1, , p. 1–37 (DOI10.1137/1013001, JSTOR2028848)
(en) Stephen P. Boyd et Lieven Vandenberghe, Convex Optimization, Cambridge University Press, , 716 p. (ISBN978-0-521-83378-3, lire en ligne [PDF]), p. 216