TY  - CHAP
CY  - Germany
ID  - iiasa14043
UR  - https://pure.iiasa.ac.at/id/eprint/14043/
A1  - Lemarechal, C.
N2  - 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).
ED  - Glowinski, R.
ED  - Lions, J.L.
ED  - Liboria, I.
M1  - 704
TI  - Optimisation non Differentiable: Methodes de Faisceaux
AV  - none
EP  - 61
Y1  - 2006///
PB  - Springer Berlin Heidelberg
T3  - Lecture Notes in Mathematics
SN  - 0075-8434
SP  - 53
T2  - Computing Methods in Applied Sciences and Engineering, 1977, I
ER  -