Within the framework of affine scaling trust-region methods for bound constrained problems, we discuss the use of an inexact dogleg method as a tool for simultaneously handling the trust-region and the bound constraints while seeking for an approximate minimizer of the model. Then, we focus on large scale bound-constrained systems of nonlinear equations which often arise in practical applications when some of the unknowns are naturally subject to constraints due to physical arguments. We introduce an inexact affine scaling method for such a class of problems that employes the inexact dogleg procedure. Global convergence results are established without any Lipschitz assumption on the Jacobian matrix, and locally fast convergence is shown under standard assumptions. Convergence analysis is performed without specifying the scaling matrix used to handle the bounds, and a rather general class of scaling matrices is allowed in actual algorithms. Numerical results showing the performance of the method are also given.

On affine scaling inexact dogleg methods for bound-constrained nonlinear systems / Stefania Bellavia; Sandra Pieraccini. - In: OPTIMIZATION METHODS & SOFTWARE. - ISSN 1055-6788. - STAMPA. - 30:(2015), pp. 276-300. [10.1080/10556788.2014.955496]

On affine scaling inexact dogleg methods for bound-constrained nonlinear systems

BELLAVIA, STEFANIA;
2015

Abstract

Within the framework of affine scaling trust-region methods for bound constrained problems, we discuss the use of an inexact dogleg method as a tool for simultaneously handling the trust-region and the bound constraints while seeking for an approximate minimizer of the model. Then, we focus on large scale bound-constrained systems of nonlinear equations which often arise in practical applications when some of the unknowns are naturally subject to constraints due to physical arguments. We introduce an inexact affine scaling method for such a class of problems that employes the inexact dogleg procedure. Global convergence results are established without any Lipschitz assumption on the Jacobian matrix, and locally fast convergence is shown under standard assumptions. Convergence analysis is performed without specifying the scaling matrix used to handle the bounds, and a rather general class of scaling matrices is allowed in actual algorithms. Numerical results showing the performance of the method are also given.
2015
30
276
300
Stefania Bellavia; Sandra Pieraccini
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/888941
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 6
social impact