In this paper, we describe a two-stage method for solving optimization problems with bound constraints. It combines the active-set estimate described in Facchinei and Lucidi (J Optim Theory Appl 85(2):265–289, 1995)with amodification of the non-monotone line search framework recently proposed in De Santis et al. (Comput Optim Appl 53(2):395–423, 2012). In the first stage, the algorithm exploits a property of the active-set estimate that ensures a significant reduction in the objective function when setting to the bounds all those variables estimated active. In the second stage, a truncated-Newton strategy is used in the subspace of the variables estimated non-active. In order to properly combine the two phases, a proximity check is included in the scheme. This new tool, together with the other theoretical features of the two stages, enables us to prove global convergence. Furthermore, under additional standard assumptions, we can showthat the algorithm converges at a superlinear rate. Promising experimental results demonstrate the effectiveness of the proposed method.
A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization / CRISTOFARI, ANDREA; DE SANTIS, MARIANNA; LUCIDI, Stefano; Rinaldi, Francesco. - In: JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS. - ISSN 0022-3239. - STAMPA. - 172:(2017), pp. 369-401. [10.1007/s10957-016-1024-9]
A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization
DE SANTIS, MARIANNA;LUCIDI, Stefano;
2017
Abstract
In this paper, we describe a two-stage method for solving optimization problems with bound constraints. It combines the active-set estimate described in Facchinei and Lucidi (J Optim Theory Appl 85(2):265–289, 1995)with amodification of the non-monotone line search framework recently proposed in De Santis et al. (Comput Optim Appl 53(2):395–423, 2012). In the first stage, the algorithm exploits a property of the active-set estimate that ensures a significant reduction in the objective function when setting to the bounds all those variables estimated active. In the second stage, a truncated-Newton strategy is used in the subspace of the variables estimated non-active. In order to properly combine the two phases, a proximity check is included in the scheme. This new tool, together with the other theoretical features of the two stages, enables us to prove global convergence. Furthermore, under additional standard assumptions, we can showthat the algorithm converges at a superlinear rate. Promising experimental results demonstrate the effectiveness of the proposed method.File | Dimensione | Formato | |
---|---|---|---|
Cristofari_A-Two-Stage_2017.pdf
Accesso chiuso
Licenza:
Tutti i diritti riservati
Dimensione
703.26 kB
Formato
Adobe PDF
|
703.26 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.