this paper we define Newton-type algorithms for the solution of box constrained quadratic programming problems. These algorithms are based on the unconstrained minimization of a continuously differentiable exact penalty function and make use of consistent approximations of the Newton's direction of the penalty function. Under suitable assumptions, finite termination at a solution of the constrained problem can be established.
On the Solution of a Class od Quadratic Programs Using a Differentiable Exact Penalty Function / Grippo, Luigi; Lucidi, Stefano. - STAMPA. - 143(1990), pp. 764-773. [10.1007/BFb0008433].
On the Solution of a Class od Quadratic Programs Using a Differentiable Exact Penalty Function
GRIPPO, Luigi;LUCIDI, Stefano
1990
Abstract
this paper we define Newton-type algorithms for the solution of box constrained quadratic programming problems. These algorithms are based on the unconstrained minimization of a continuously differentiable exact penalty function and make use of consistent approximations of the Newton's direction of the penalty function. Under suitable assumptions, finite termination at a solution of the constrained problem can be established.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.