On the use of the energy norm in trust-region and adaptive cubic regularization subproblems

E. Bergou (), Y. Diouane () and S. Gratton ()
Additional contact information
E. Bergou: Université Paris-Saclay
Y. Diouane: Université de Toulouse
S. Gratton: Université de Toulouse

Computational Optimization and Applications, 2017, vol. 68, issue 3, No 4, 533-554

Abstract: Abstract We consider solving unconstrained optimization problems by means of two popular globalization techniques: trust-region (TR) algorithms and adaptive regularized framework using cubics (ARC). Both techniques require the solution of a so-called “subproblem” in which a trial step is computed by solving an optimization problem involving an approximation of the objective function, called “the model”. The latter is supposed to be adequate in a neighborhood of the current iterate. In this paper, we address an important practical question related with the choice of the norm for defining the neighborhood. More precisely, assuming here that the Hessian B of the model is symmetric positive definite, we propose the use of the so-called “energy norm”—defined by $$\Vert x\Vert _B= \sqrt{x^TBx}$$ ‖ x ‖ B = x T B x for all $$x \in \mathbb {R}^n$$ x ∈ R n —in both TR and ARC techniques. We show that the use of this norm induces remarkable relations between the trial step of both methods that can be used to obtain efficient practical algorithms. We furthermore consider the use of truncated Krylov subspace methods to obtain an approximate trial step for large scale optimization. Within the energy norm, we obtain line search algorithms along the Newton direction, with a special backtracking strategy and an acceptability condition in the spirit of TR/ARC methods. The new line search algorithm, derived by ARC, enjoys a worst-case iteration complexity of $$\mathcal {O}(\epsilon ^{-3/2})$$ O ( ϵ - 3 / 2 ) . We show the good potential of the energy norm on a set of numerical experiments.

Keywords: Nonlinear optimization; Unconstrained optimization; Trust-region algorithm; Adaptive regularized framework using cubics; Line search algorithm; Energy norm; Krylov subspace methods; Conjugate gradient (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-017-9929-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:68:y:2017:i:3:d:10.1007_s10589-017-9929-2

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-017-9929-2

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().