## Selected publications

- An algorithm for minimizing convex functions, Proc. IFIP'74, Stockholm, 1974
- Minimization of nondifferentiable functions with constraints, Proc. 12th Conf on Circuit Theory, Urbana-Champaign 1974
- An extension of Davidon methods to nondifferentiable problems, Math Prog Study 3, Balinski & Wolfe Eds (1975)
- Nondifferentiable optimization; subgradient and epsilon-subgradient methods, Lecture Notes on Economics and Mathematical Systems 117, 1976
- Bundle methods in nonsmooth optimization, Proc. 1st IIASA Workshop on nonsmooth optimization, Lemarechal & Mifflin Eds (1978)
- A view of line searches, in: Optimization and Optimal Control, Auslender, Oettli, Stoer Eds, Lecture Notes in Control and Information Sciences 30, Springer Verlag (1981)
- The watchdog technique for forcing convergence in algorithms for constrained optimization. Math. Prog. Study 16 (1982) (with Chamberlain, Pedersen, Powell).
- Global and super linear convergence of an algorithm for one dimensional minimization of convex functions. Mathematical Programming 24,3 (with R. Mifflin).
- Some remarks on the construction of higher order algorithms in convex optimization. AMO 10 (1983) 51-68 (with J. Zowe).
- First order approximation to a multi-valued mapping I A proposal (with J. Zowe, V.F. Demjanov) AMO 14 (1986) 203-214.
- Some numerical experiments with variable-storage quasi-Newton algorithms (with J.C. Gilbert) Mathematical Programming 45,3 (1989) 407-435.
- The eclipsing concept to approximate a multi-valued mapping (with J. Zowe) Optimization 22,1(1991) pp 3-37.
- Dual methods in entropy maximization. Application to some problems in crystallography (with R. Decarreau, D. Hilhorst, J. Navaza) SIOPT 2,2 (1992)173-197.
- Convergence of some algorithms for convex minimization (with R. Correa). Mathematical Programming 62,2 (1993) 261-275.
- New variants of bundle methods (with A. Nemirovski, Yu. Nesterov) Mathematical Programming 69 (1995),111-147.
- A family of variable metric proximal methods (with J.F. Bonnans, J.Ch. Gilbert, C.A. Sagastizàbal). Mathematical Programming 68,1(1995) 15-47.
- More than first-order developments of convex functions: primal-dual relations. Journal of Convex Analysis 3(1996), 255-268 (with C. Sagastizàbal).
- Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries. SIOPT 7,2(1997) 367-385 (with C. Sagastiz'abal).
- Variable metric bundle methods: from conceptual to implementable forms. Mathematical Programming 76,3 (1997), pp. 393-410 (with C. Sagastizàbal).
- The U-Lagrangian af a convex function. Trans. AMS 352,2 (2000), pp.711-729 (with F. Oustry and C. Sagastizàbal).
- Bundle methods in stochastic optimal power management: a disaggregated approach using preconditioners. Computational Optimization and Applications (with L. Bacaud, A. Renaud, C. Sagastizàbal).
- A geometric study of duality gaps, with applications. Mathematical Programming 90,3(2001) pp. 399-427 (with A. Renaud).
- Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization, Inria Report RR3710 (1999) (with F. Oustry).
- Growth conditions and U-Lagrangians. Set-Valued Analysis 9 (2001) pp. 123-129 (with F. Oustry).
- Lagrangian relaxation. In: M. Junger, D. Naddef (Eds.), LNCS, Springer Verlag, 2001.
- SDP relaxations in combinatorial optimization from a Lagrangian viewpoint. In: Advances in Convex Analysis and Global Optimization, N. Hadjisavvas, P.M. Pardalos (Eds.), Kluwer, 2001.
- The omnipresence of Lagrange. 4OR 1,1(2003) pp. 7-25.
- On a primal-proximal heuristic in discrete optimization. Mathematical Programming 104,1(2005) pp. 105-128 (with A. Daniilidis).
- A primal-proximal heuristic applied to the French unit-commitment problem. Mathematical Programming 104,1(2005) pp. 129-152 (with L. Dubost, R. Gonzalez).
- On the equivalence between complementarity systems, projected systems and differential inclusions. Systems and Control Letters 55(2006) pp.45-51 (with B. Brogliato, A. Daniilidis, V. Acary).
- A convex-analysis perspective of disjunctive cuts. Mathematical Programming 106,3(2005) pp. 567-586 (with G. Cornuéjols).
- Comparison of bundle and classical column generation. To appear in Mathematical Programming (with O. Briant, Ph. Meurdesoif, S. Michel, N. Perrot, F. Vanderbeck).
- An inexact conic buncle variant suited to column generation. Submitted to Mathematical Programming (with K.C. Kiwiel).
- A bundle-type algorithm for routing in telecommunication data networks. Submitted to Computational Optimization and Applications (with A. Ouorou, G. Petrou).