A class of trust-region methods for large scale bound-constrained systems of nonlinear equations is presented. The methods in this class follow the so called affine-scaling approach and can efficiently handle large scale problems. At each iteration, a suitably scaled region around the current approximate solution is defined and, within such a region, the norm of the linear model of F is trusted...

A class of trust-region methods for large scale bound-constrained systems of nonlinear equations is presented. The methods in this class follow the so called affine-scaling approach and can efficiently handle large scale problems. At each iteration, a suitably scaled region around the current approximate solution is defined and, within such a region, the norm of the linear model of F is trusted...

The diierential dynamic programming algorithm (DDP) and the stage-wise Newton procedure are two typical examples of eecient local procedures for discrete-time optimal control (DTOC) problems. It is desirable to generalize these local procedures to globally convergent methods. One successful globalization was recently proposed by Coleman and Liao 3] which combines the trust region idea with Pant...

In recent years, the UAV’s are increasingly becoming main part of both military and commercial operations, where accurate pose estimation is considered as a critical problem to be investigated. UAV pose estimation problem can be investigated through vision based navigation (VBN) approach where visual sensors are augmented with the traditional IMU unit. VBN is based on localizing set of features...

We give a fast, accurate, and highly convergent algorithm for computing periodic orbits of the N-body problem. The Lindstedt-Poincaré technique from perturbation theory, Fourier interpolation, the dogleg strategy devised by Powell for trust region methods in unconstrained optimization, proper handling of the symmetries of the Hamiltonian, and a simple mechanism to eliminate high frequency error...

The classical trust-region method for unconstrained minimization can be augmented with a line search that finds a point that satisfies the Wolfe conditions. One can use this new method to define an algorithm that simultaneously satisfies the quasi-Newton condition at each iteration and maintains a positive-definite approximation to the Hessian of the objective function. This new algorithm has s...

Solving the trust-region subproblem (TRS) plays a key role in numerical optimization and many other applications. The generalized Lanczos (GLTR) method is well-known type approach for solving large-scale TRS. projects original TRS onto sequence of lower dimensional Krylov subspaces, whose orthonormal bases are generated by symmetric process, computes approximate solutions from underlying subspa...