The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Solving Nonconvex Optimal Control Problems by Convex Optimization
Abstract
Motivated by aerospace applications, this paper presents a methodology to use second-order cone programming to solve nonconvex optimal control problems. The nonconvexity arises from the presence of concave state inequality constraints and nonlinear terminal equality constraints. The development relies on a solution paradigm, in which the concave inequality constraints are approximated by successive linearization. Analysis is performed to establish the guaranteed satisfaction of the original inequality constraints, the existence of the successive solutions, and the equivalence of the solution of the original problem to the converged successive solution. These results lead to a rigorous proof of the convergence of the successive solutions under appropriate conditions as well as nonconservativeness of the converged solution. The nonlinear equality constraints are treated in a two-step procedure in which the constraints are first approximated by first-order expansions, then compensated by second-order corrections in each of the successive problems for enhanced convergence robustness. Applications in highly constrained spacecraft rendezvous and proximity operations, finite-thrust orbital transfers, and optimal launch ascent are provided to demonstrate the effectiveness of the methodology.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
YALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149
Introduction to Numerical Analysis.
Froberg, C.-E., Stoer, J., & Bulirsch, R. (1981) · Mathematics of Computation · doi:10.2307/2007454 · Cited by 5,463
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
A class of methods for solving nonlinear simultaneous equations
Broyden, C. G. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0198670-6 · Cited by 2,788
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Introduction to Numerical Analysis
Stoer, J., & Bulirsch, R. (1980) · Springer eBooks · doi:10.1007/978-1-4757-5592-3 · Cited by 2,154
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
Alizadeh, F., & Goldfarb, D. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0339-5 · Cited by 1,500
Nonlinear Programming: A Unified Approach.
Beale, E. M. L., & Zangwill, W. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343701 · Cited by 1,057
Automated Rendezvous and Docking of Spacecraft
Fehse, W. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511543388 · Cited by 770
Convex Programming Approach to Powered Descent Guidance for Mars Landing
Acikmese, B., & Ploen, S. R. (2007) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.27553 · Cited by 697
On implementing a primal-dual interior-point method for conic quadratic optimization
Andersen, E. D., Roos, C., & Tamás Terlaky, B. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0349-3 · Cited by 674
Spacecraft Trajectory Planning with Avoidance Constraints Using Mixed-Integer Linear Programming
Richards, A., Schouwenaars, T., How, J. P., et al. (2002) · Journal of Guidance Control and Dynamics · doi:10.2514/2.4943 · Cited by 508
Minimum-Landing-Error Powered-Descent Guidance for Mars Landing Using Convex Optimization
Blackmore, L., Açikmeşe, B., & Scharf, D. P. (2010) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.47202 · Cited by 378
A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
Griffith, R. E., & Stewart, R. A. D. (1961) · Management Science · doi:10.1287/mnsc.7.4.379 · Cited by 335
Acikmese, B., Carson, J. M., & Blackmore, L. (2013) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2012.2237346 · Cited by 316
Autonomous Trajectory Planning for Rendezvous and Proximity Operations by Conic Optimization
Lu, P., & Liu, X. (2013) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.58436 · Cited by 301
Self-citationSequential Quadratic Programming
(2006) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/978-0-387-40065-5_18 · Cited by 297
Lossless convexification of a class of optimal control problems with non-convex control constraints
Açıkmeşe, B., & Blackmore, L. (2011) · Automatica · doi:10.1016/j.automatica.2010.10.037 · Cited by 242
Nonlinear Optimization by Successive Linear Programming
Palacios-Gomez, F., Lasdon, L., & Engquist, M. (1982) · Management Science · doi:10.1287/mnsc.28.10.1106 · Cited by 186
Convex Control Systems and Convex Optimal Control Problems With Constraints
Azhmyakov, V., & Raisch, J. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.919848 · Cited by 63
Collision avoidance maneuver planning with robust optimization
Mueller, J., & Larsson, R. (2008) · Cited by 37
Autonomous Trajectory Planning by Convex Optimization
Liu, X. (2013) · Iowa State University Digital Repository (Iowa State University) · doi:10.31274/etd-180810-3525 · Cited by 32
Self-citation
Cited by
Model Predictive Control in Aerospace Systems: Current State and Opportunities
Eren, U., Prach, A., Koçer, B. B., Raković, S. V., Kayacan, E., & Açıkmeşe, B. (2017) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.g002507 · Cited by 410
Entry Trajectory Optimization by Second-Order Cone Programming
Liu, X., Shen, Z., & Lu, P. (2016) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.g001210 · Cited by 349
Self-citationSurvey of convex optimization for aerospace applications
Liu, X., Lu, P., & Pan, B. (2017) · Astrodynamics · doi:10.1007/s42064-017-0003-8 · Cited by 341
Self-citationMalyuta, D., Reynolds, T. P., Szmuk, M., Lew, T., Bonalli, R., Pavone, M., & Açıkmeşe, B. (2022) · IEEE Control Systems · doi:10.1109/mcs.2022.3187542 · Cited by 259
Federated Learning on the Road Autonomous Controller Design for Connected and Autonomous Vehicles
Zeng, T., Semiari, O., Chen, M., Saad, W., & Bennis, M. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3183996 · Cited by 131
Metadata
- Authors
- Liu, X., & Lu, P.
- Venue
- Journal of Guidance, Control, and Dynamics
- Published
- 2014-05
- Volume
- 37
- Issue
- 3
- Pages
- 750-765
- ISSN
- 0731-5090 (ISSN-L)
- 1533-3884
- OpenAlex
- W1966185282
- Cited by
- 358
- References
- 24
- FWCI
- 23.99
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.