%S Lecture Notes in Mathematics
%A C. Lemarechal
%T Optimisation non Differentiable: Methodes de Faisceaux
%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).
%P 53-61
%B Computing Methods in Applied Sciences and Engineering, 1977, I
%E R. Glowinski
%E J.L. Lions
%E I. Liboria
%V 704
%C Germany
%D 2006
%I Springer Berlin Heidelberg
%R 10.1007/BFb0063614
%L iiasa14043