Reentry trajectory optimization is a multi-constraints optimal control problem which is hard to solve. To tackle it, we proposed a new algorithm named CDEN(Constrained Differential Evolution Newton-Raphson Algorithm) based on Differential Evolution(DE) and Newton-Raphson. We transform the infinite dimensional optimal control problem to parameter optimization which is finite dimensional by discr...

The identification of dynamical systems from data is a powerful tool in robotics [3]. Learned analytic models may be used for control synthesis and can utilized gravitational inertial compensation [75]. When as simulators, these reduce the sample complexity data-driven methods such RL [15, 11, 28, 46]. For applications, where out-of-distribution prediction typically required, ability to general...

We analyze the relations of the van den Elzen-Talman algorithm, the Lemke-Howson algorithm and the global Newton method introduced by Govindan and Wilson. It is known that the global Newton method encompasses the Lemke-Howson algorithm; we prove that it also comprises the van den Elzen-Talman algorithm, and more generally, the linear tracing procedure, as a special case. This will lead us to a ...

For unconstrained optimization, Newton-type methods have good convergence properties, and areused in practice. The Newton’s method combined with a trust-region method (the TR-Newtonmethod), the cubic regularization of Newton’s method and the regularized Newton method withline search methods are such Newton-type methods. The TR-Newton method and the cubic regu-larization of N...

In this paper we present a modified BFGS algorithm for unconstrained optimization. The BFGS algorithm updates an approximate Hessian which satisfies the most recent quasi-Newton equation. The quasi-Newton condition can be interpreted as the interpolation condition that the gradient value of the local quadratic model matches that of the objective function at the previous iterate. Our modified al...

We present a parallel Newton-Krylov algorithm for solving the three-dimensional Euler equations on multi-block structured meshes. The Euler equations are discretized on each block independently using second-order accurate summation-by-parts operators and scalar numerical dissipation. Boundary conditions are imposed and block interfaces are coupled using simultaneous approximation terms (SATs). ...

In this paper some Newton and quasi-Newton algorithms for the solution of inequality constrained minimization problems are considered. All the algorithms described produce sequences fx k g converging q-superlinearly to the solution. Furthermore , under mild assumptions, a q-quadratic convergence rate in x is also attained. Other features of these algorithms are that the solution of linear syste...

We present a phase-based potential ordering that is an extension of the Cascade ordering introduced by Appleyard and Cheshire [1]. The ordering is valid for both two-phase and three-phase flow, and it can handle countercurrent flow due to gravity and/or capillarity. We show how this ordering can be used to reduce the nonlinear algebraic system that arise from the fully-implicit method (FIM) int...