Sequential Convex Programming Using Augmented Lagrange Multiplier Method and Concave-Convex Decomposition

No AccessEngineering NotesSequential Convex Programming Using Augmented Lagrange Multiplier Method and Concave–Convex DecompositionLi Jun, Zhang Sifeng, Jiang Zhenyu, Bai Xibin and Yang HuaboLi Jun https://orcid.org/0000-0002-9225-0669National University of Defense Technology, 410073 Changsha, People’s Republic of China*Ph.D. Student, College of Aerospace Science and Engineering; (Corresponding Author).Search for more papers by this author, Zhang SifengNational University of Defense Technology, 410073 Changsha, People’s Republic of China†Professor, College of Aerospace Science and Engineering; (Co-Corresponding Author).Search for more papers by this author, Jiang ZhenyuNational University of Defense Technology, 410073 Changsha, People’s Republic of China‡Professor, College of Aerospace Science and Engineering.Search for more papers by this author, Bai XibinNational University of Defense Technology, 410073 Changsha, People’s Republic of China§Associate Professor, College of Aerospace Science and Engineering.Search for more papers by this author and Yang HuaboNational University of Defense Technology, 410073 Changsha, People’s Republic of China§Associate Professor, College of Aerospace Science and Engineering.Search for more papers by this authorPublished Online:30 Nov 2022https://doi.org/10.2514/1.G006766SectionsRead Now ToolsAdd to favoritesDownload citationTrack citations ShareShare onFacebookTwitterLinked InRedditEmail About References [1] Benedikter B., Zavoli A., Colasurdo G., Pizzurro S. and Cavallini E., “Convex Approach to Three-Dimensional Launch Vehicle Ascent Trajectory Optimization,” Journal of Guidance, Control, and Dynamics, Vol. 44, No. 6, 2021, pp. 1116–1131. https://doi.org/10.2514/1.G005376 LinkGoogle Scholar[2] Wang Z. and Grant M. J., “Minimum-Fuel Low-Thrust Transfers for Spacecraft: A Convex Approach,” IEEE Transactions on Aerospace and Electronic Systems, Vol. 54, No. 5, 2018, pp. 2274–2290. https://doi.org/10.1109/TAES.2018.2812558 CrossrefGoogle Scholar[3] Wang Z. and Lu Y., “Improved Sequential Convex Programming Algorithms for Entry Trajectory Optimization,” Journal of Spacecraft and Rockets, Vol. 57, No. 6, 2020, pp. 1373–1386. https://doi.org/10.2514/1.A34640 LinkGoogle Scholar[4] Açıkmeşe B., Carson J. M. and Blackmore L., “Lossless Convexification of Nonconvex Control Bound and Pointing Constraints of the Soft Landing Optimal Control Problem,” IEEE Transactions on Control Systems Technology, Vol. 21, No. 6, 2013, pp. 2104–2113. https://doi.org/10.1109/TCST.2012.2237346 CrossrefGoogle Scholar[5] Zhou X., He R.-Z., Zhang H.-B., Tang G.-J. and Bao W.-M., “Sequential Convex Programming Method Using Adaptive Mesh Refinement for Entry Trajectory Planning Problem,” Aerospace Science and Technology, Vol. 109, Feb. 2021, Paper 106374. https://doi.org/10.1016/j.ast.2020.106374 Google Scholar[6] Reynolds T. P. and Mesbahi M., “The Crawling Phenomenon in Sequential Convex Programming,” 2020 American Control Conference (ACC), IEEE, New York, 2020, pp. 3613–3618. https://doi.org/10.23919/ACC45564.2020.9147550 Google Scholar[7] Lu P., “Convex–Concave Decomposition of Nonlinear Equality Constraints in Optimal Control,” Journal of Guidance, Control, and Dynamics, Vol. 44, No. 1, 2021, pp. 4–14. https://doi.org/10.2514/1.G005443 LinkGoogle Scholar[8] Ito K. and Kunisch K., Lagrange Multiplier Approach to Variational Problems and Applications, Advances in Design and Control, Soc. for Industrial and Applied Mathematics, Philadelphia, PA, 2008, pp. 65–85. https://doi.org/10.1137/1.9780898718614 Google Scholar[9] Lipp T. and Boyd S., “Variations and Extension of the Convex–Concave Procedure,” Optimization and Engineering, Vol. 17, No. 2, 2016, pp. 263–287. https://doi.org/10.1007/s11081-015-9294-x CrossrefGoogle Scholar[10] Bertsekas D., “On Penalty and Multiplier Methods for Constrained Minimization,” SIAM Journal on Control and Optimization, Vol. 14, No. 2, 1976, pp. 216–235. https://doi.org/10.1137/0314017 Google Scholar[11] Bertsekas D. P., “Combined Primal-Dual and Penalty Methods for Constrained Minimization,” SIAM Journal on Control, Vol. 13, No. 3, 1975, pp. 521–544. https://doi.org/10.1137/0313030 Google Scholar[12] Lanckriet G. and Sriperumbudur B. K., “On the Convergence of the Concave-Convex Procedure,” Advances in Neural Information Processing Systems, Vol. 22, Curran Associates, Inc., Red Hook, NY, 2009, pp. 1759–1765. Google Scholar[13] Yuille A. L. and Rangarajan A., “The Concave-Convex Procedure,” Neural Computation, Vol. 15, No. 4, 2003, pp. 915–936. https://doi.org/10.1162/08997660360581958 CrossrefGoogle Scholar[14] Castro P. M., “Tightening Piecewise McCormick Relaxations for Bilinear Problems,” Computers & Chemical Engineering, Vol. 72, 2015, pp. 300–311. https://doi.org/10.1016/j.compchemeng.2014.03.025 CrossrefGoogle Scholar[15] Murillo O. and Lu P., “Fast Ascent Trajectory Optimization for Hypersonic Air-Breathing Vehicles,” AIAA Guidance, Navigation, and Control Conference, AIAA Paper 2010-8173, AIAA, Reston, VA, 2010, pp. 1–24. https://doi.org/10.2514/6.2010-8173 Google Scholar[16] Malyuta D., Reynolds T., Szmuk M., Mesbahi M., Acikmese B. and Carson J. M., “Discretization Performance and Accuracy Analysis for the Rocket Powered Descent Guidance Problem,” AIAA Scitech 2019 Forum, AIAA Paper 2019-0925, 2019. https://doi.org/10.2514/6.2019-0925 LinkGoogle Scholar[17] Domahidi A., Chu E. and Boyd S., “ECOS: An SOCP Solver for Embedded Systems,” 2013 European Control Conference (ECC), IEEE, New York, 2013, pp. 3071–3076. https://doi.org/10.23919/ECC.2013.6669541 Google Scholar[18] Patterson M. A. and Rao A. V., “GPOPS-II: A MATLAB Software for Solving Multiple-Phase Optimal Control Problems Using hp-Adaptive Gaussian Quadrature Collocation Methods and Sparse Nonlinear Programming,” ACM Transactions on Mathematical Software, Vol. 41, No. 1, 2014, pp. 1–37. https://doi.org/10.1145/2558904 CrossrefGoogle Scholar[19] Gill P. E., Murray W. and Saunders M. A., “SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization,” SIAM Review, Vol. 47, No. 1, 2005, pp. 99–131. https://doi.org/10.1137/S0036144504446096 CrossrefGoogle Scholar[20] Lofberg J., “YALMIP: A Toolbox for Modeling and Optimization in MATLAB,” 2004 IEEE International Conference on Robotics and Automation, IEEE, New York, Sept. 2004, pp. 284–289. https://doi.org/10.1109/CACSD.2004.1393890 Google Scholar Previous article Next article FiguresReferencesRelatedDetails What's Popular Volume 46, Number 4April 2023 CrossmarkInformationCopyright © 2022 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved. All requests for copying and permission to reprint should be submitted to CCC at www.copyright.com; employ the eISSN 1533-3884 to initiate your request. See also AIAA Rights and Permissions www.aiaa.org/randp. TopicsAlgorithms and Data StructuresComputing, Information, and CommunicationControl TheoryData ScienceGradient MethodGuidance, Navigation, and Control SystemsInterdisciplinary TopicsMultidisciplinary Design OptimizationOptimal Control TheoryOptimization Algorithm KeywordsTrajectory OptimizationOptimization AlgorithmAugmented Lagrangian MethodAcknowledgmentThis work was supported by the National Natural Science Foundation of China (U21B2028), “Research on Intelligent Control Method of Launch Vehicle Based on Online Incremental Learning.”PDF Received8 March 2022Accepted9 November 2022Published online30 November 2022