Efficient Parameter Selection for Scaled Trust-Region Newton Algorithm in Solving Bound-constrained Nonlinear Systems

We investigate the problem of parameter selection for the scaled trust-region Newton (STRN) algorithm in solving bound-constrained nonlinear equations. Numerical experiments were performed on a large number of test problems to find the best value range of parameters that give the least algorithm iterations and function evaluations. Our experiments demonstrate that, in general, there is no best parameter to be chosen and each specific value shows an efficient performance on some problems and weak performance on other ones. In this research, we report the performance of STRN for various choices of parameters and then suggest the most effective one.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/26/2019

Quasi-Newton Trust Region Policy Optimization

We propose a trust region method for policy optimization that employs Qu...
research
06/28/2021

Leveraging GPU batching for scalable nonlinear programming through massive Lagrangian decomposition

We present the implementation of a trust-region Newton algorithm ExaTron...
research
04/12/2021

Review of Lambert's problem

Lambert's problem is the orbital boundary-value problem constrained by t...
research
06/30/2023

Solving nonlinear ODEs with the ultraspherical spectral method

We extend the ultraspherical spectral method to solving nonlinear ODE bo...
research
06/19/2021

SAN: Stochastic Average Newton Algorithm for Minimizing Finite Sums

We present a principled approach for designing stochastic Newton methods...
research
06/16/2023

Algorithm MGB to solve highly nonlinear elliptic PDEs in Õ(n) FLOPS

We introduce Algorithm MGB (Multi Grid Barrier) for solving highly nonli...
research
12/09/2018

A note on solving nonlinear optimization problems in variable precision

This short note considers an efficient variant of the trust-region algor...

Please sign up or login with your details

Forgot password? Click here to reset