Convergence Properties of Newton's Method for Globally Optimal Free Flight Trajectory Optimization

07/06/2023
by   Ralf Borndörfer, et al.
0

The algorithmic efficiency of Newton-based methods for Free Flight Trajectory Optimization is heavily influenced by the size of the domain of convergence. We provide numerical evidence that the convergence radius is much larger in practice than what the theoretical worst case bounds suggest. The algorithm can be further improved by a convergence-enhancing domain decomposition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2019

Benchmarking results for the Newton-Anderson method

This paper primarily presents numerical results for the Anderson acceler...
research
02/21/2020

Detailed Proofs of Alternating Minimization Based Trajectory Generation for Quadrotor Aggressive Flight

This technical report provides detailed theoretical analysis of the algo...
research
03/27/2021

A Generalized Multivariable Newton Method

It is well known that the Newton method may not converge when the initia...
research
10/04/2019

The Ivanov regularized Gauss-Newton method in Banach space with an a posteriori choice of the regularization radius

In this paper we consider the iteratively regularized Gauss-Newton metho...
research
01/29/2021

Interleaving Graph Search and Trajectory Optimization for Aggressive Quadrotor Flight

Quadrotors can achieve aggressive flight by tracking complex maneuvers a...
research
02/26/2020

Fast Linear Convergence of Randomized BFGS

Since the late 1950's when quasi-Newton methods first appeared, they hav...
research
04/12/2022

Error Bounds for Discrete-Continuous Shortest Path Problems with Application to Free Flight Trajectory Optimization

Two-stage methods addressing continuous shortest path problems start loc...

Please sign up or login with your details

Forgot password? Click here to reset