Sensitivity of trust-region algorithms to their parameters

In this paper, we examine the sensitivity of trust-region algorithms on the parameters related to the step acceptance and update of the trust region. We show, in the context of unconstrained programming, that the numerical efficiency of these algorithms can easily be improved by choosing appropriate parameters. Recommended ranges of values for these parameters are exhibited on the basis of extensive numerical tests. © Springer-Verlag 2005

Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints

Abstract. A class of trust region-based algorithms is presented for the solution of nonlinear optimization problems with a convex feasible set. At variance with previously published analyses of this type, the theory presented allows for the use of general norms. Furthermore, the proposed algorithms do not require the explicit computation of the projected gradient, and can therefore be adapted to cases where the projection onto the feasible domain may be expensive to calculate. Strong global convergence results are derived for the class. It is also shown that the set of linear and nonlinear constraints that are binding at the solution are identified by the algorithms of the class in a finite number of iterations. Key words, trust region methods, projected gradients, convex constraints AMS(MOS) subject classifications. 90C30, 65K05 1. Introduction. Trus

Componentwise fast convergence in the solution of full-rank systems of nonlinear equations

The asymptotic convergence of parameterized variants of Newton’s method for the solution of nonlinear systems of equations is considered. The original system is perturbed by a term involving the variables and a scalar parameter which is driven to zero as the iteration proceeds. The exact local solutions to the perturbed systems then form a differentiable path leading to a solution of the original system, the scalar parameter determining the progress along the path. A path-following algorithm, which involves an inner iteration in which the perturbed systems are approximately solved, is outlined. It is shown that asymptotically, a single linear system is solved per update of the scalar parameter. It turns out that a componentwise Q-superlinear rate may be attained, both in the direct error and in the residuals, under standard assumptions, and that this rate may be made arbitrarily close to quadratic. Numerical experiments illustrate the results and we discuss the relationships that this method shares with interior methods in constrained optimization

Early carboniferous brachiopod faunas from the Baoshan block, west Yunnan, southwest China

38 brachiopod species in 27 genera and subgenera are described from the Yudong Formation in the Shidian-Baoshan area, west Yunnan, southwest China. New taxa include two new subgenera: Unispirifer (Septimispirifer) and Brachythyrina (Longathyrina), and seven new species: Eomarginifera yunnanensis, Marginatia cylindrica, Unispirifer (Unispirifer) xiangshanensis, Unispirifer (Septimispirifer) wafangjieensis, Brachythyrina (Brachythyrina) transversa, Brachythyrina (Longathyrina) baoshanensis, and Girtyella wafangjieensis. Based on the described material and constraints from associated coral and conodont faunas, the age of the brachiopod fauna from the Yudon Formation is considered late Tournaisian (Early Carboniferous), with a possibility extending into earlyViseacutean.<br /