An implementable descent method for unconstrained minimization of convex nonsmooth functions of several variables is described. The algorithm is characterized by the use of a set of quadratic approximations of the objective function in order to compute the search direction. The resulting direction finfing subproblem is shown to be equivalent to a structured parametric quadratic programming problem. The convergence of the algorithm to the minimum is proved, and numerical experience is reported.
Quadratic approximations in convex nondifferentiable optimization
GAUDIOSO, Manlio;MONACO, Maria Flavia
1991-01-01
Abstract
An implementable descent method for unconstrained minimization of convex nonsmooth functions of several variables is described. The algorithm is characterized by the use of a set of quadratic approximations of the objective function in order to compute the search direction. The resulting direction finfing subproblem is shown to be equivalent to a structured parametric quadratic programming problem. The convergence of the algorithm to the minimum is proved, and numerical experience is reported.File in 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.
