%0 Book Section
%@ 978-3-540-35411-6
%A Lemarechal, C.
%B Computing Methods in Applied Sciences and Engineering, 1977, I
%C Germany
%D 2006
%E Glowinski, R.
%E Lions, J.L.
%E Liboria, I.
%F iiasa:14043
%I Springer Berlin Heidelberg
%P 53-61
%R 10.1007/BFb0063614
%S Lecture Notes in Mathematics
%T Optimisation non Differentiable: Methodes de Faisceaux
%U https://pure.iiasa.ac.at/id/eprint/14043/
%V 704
%X We define a class of descent methods to minimize a nondifferentiable function. These methods are based on a representation of the objective which combines a quadratic approximation and the usual approximation by a piecewise linear function. Hence, they realize a synthesis between quasi-Newton methods and cutting plane methods. In addition, they have the particularity of requiring no sophisticated line search. They are also presented in ref. [7] (in English).