Newton's method for global free flight trajectory optimization

From MaRDI portal
Publication:6081827



Abstract: Globally optimal free flight trajectory optimization can be achieved with a combination of discrete and continuous optimization. A key requirement is that Newton's method for continuous optimization converges in a sufficiently large neighborhood around a minimizer. We show in this paper that, under certain assumptions, this is the case.


The paper considers the second stage of a two-stage algorithm for solving the free flight trajectory optimization problem to global optimality. Specifically, it is shown that under certain assumptions there is a neighborhood around a global minimizer such that Newton's method converges to this minimizer when applied to the KKT conditions. The result requires that the iterates remain in an \(L^\infty\) neighborhood of the minimizer and yields q-linear convergence in \(L^2\). The paper is of theoretical nature in that it does not contain numerical experiments.











This page was built for publication: Newton's method for global free flight trajectory optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081827)