We introduce a method for solving a nonsmooth optimization problem. The algorithm constructs a sequence {xk} where Xk-1 = x̃ and x̃ is a solution of a variational inequality problem and satisfies an Armijo-type condition. A convergence theorem for the algorithm is established and some numerical results are reported.
A method for nonsmooth optimization problems / Corradi, Gianfranco. - In: INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS. - ISSN 0020-7160. - 81:6(2004), pp. 693-705. [10.1080/0020716031000148197]
A method for nonsmooth optimization problems
CORRADI, Gianfranco
2004
Abstract
We introduce a method for solving a nonsmooth optimization problem. The algorithm constructs a sequence {xk} where Xk-1 = x̃ and x̃ is a solution of a variational inequality problem and satisfies an Armijo-type condition. A convergence theorem for the algorithm is established and some numerical results are reported.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
