Fun fact: recent notable rocket landings seem to use convex optimization to solve the soft landing problem, AFAICT. See here for more info: http://web.mit.edu/

Fun fact: recent notable rocket landings seem to use convex optimization to solve the soft landing problem, AFAICT. See here for more info: http://web.mit.edu/larsb/www/iee_tcst13.pdf http://web.mit.edu/larsb/www/iee_tcst13.pdf > This convexification enables the planetary soft landing problem to be solved optimally by using convex optimization, and is hence amenable to onboard implementation with a priori bounds on the computational complexity and realtime execution time.