Feasible Sequential Convex Programming With Inexact Restoration for Multistage Ascent Trajectory Optimization

This article presents a feasible sequential convex programming method to solve the multistage ascent trajectory optimization problem. The proposed method is based on the inexact restoration technique, in which a more feasible intermediate iterate is first produced by solving a constrained least-squa...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on aerospace and electronic systems Vol. 59; no. 2; pp. 1217 - 1230
Main Authors:	Ma, Yangyang, Pan, Binfeng, Yan, Rui
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.04.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Aerodynamics Ascent trajectories Ascent trajectory optimization Chebyshev approximation Computational geometry Convergence Convexity feasible sequential convex programming inexact restoration (IR) Iterative methods launch vehicle Least squares method Mathematical programming Orbits Picard iterations Polynomials Programming Restoration Robustness Robustness (mathematics) Trajectory optimization Vehicle dynamics
ISSN:	0018-9251, 1557-9603
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!