Optimisation non Differentiable: Methodes de Faisceaux

Lemarechal C (2006). Optimisation non Differentiable: Methodes de Faisceaux. In: Computing Methods in Applied Sciences and Engineering, 1977, I. Eds. Glowinski, R., Lions, J.L. & Liboria, I., pp. 53-61 Germany: Springer Berlin Heidelberg. ISBN 978-3-540-35411-6 DOI:10.1007/BFb0063614.

Full text not available from this repository.

Abstract

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).

Item Type: Book Section
Research Programs: World Population (POP)
Depositing User: Romeo Molina
Date Deposited: 01 Dec 2016 10:38
Last Modified: 01 Dec 2016 10:38
URI: http://pure.iiasa.ac.at/14043

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313