Abstract
In this contribution we present two interior-point path-following algorithms that solve the convex optimisation problem that arises in recentred barrier function model predictive control (MPC), which includes standard MPC as a limiting case. However the optimisation problem that arises in nonlinear MPC may not be convex. In this case we propose sequential convex programming (SCP) as an alternative to sequential quadratic programming. The algorithms are appropriate for the convex program that arises at each iteration of such an SCP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albuquerque, J. and V. Gopal and G. Staus and L. T. Biegler and B. E. Yd-stie. “Interior point SQP strategies for structured process optimization problems”. Computers & Chemical Engineering 2, S853–S859, (1997).
Boyd, S. and L. Vandenberghe. Convex optimization. Cambridge University Press. Cambridge UK (2004).
Fiacco, A. V. and G. P. McCormick. Nonlinear Programming: Sequential Uncon-strained Minimization Techniques. John Wiley & Sons Inc. New York, (1968).
Gopal, V. and L. T. Biegler. “Large scale inequality constrained optimization and control”. IEEE Control Systems Magazine 18(6), 59–68, (1998).
Kailath, T. Linear Systems. Prentice-Hall. Englewood Cliffs, New Jersey, (1980).
Mayne, D. Q., Rawlings, J. B., Rao, C. V. and Scokaert, P. O. M., “Constrained Model Predictive Control: Stability and optimality”, Automatica., 36, 789–814, (2000).
Nesterov, Y. and A. Nemirovskii. Interior-point Polynomial Algorithms in Convex Programming. SIAM. Philadelphia, (1994).
Nesterov, Y. E. and M. J. Todd. “Self-scaled cones and interior-point methods in nonlinear programming“D. Mathematics of Operations Research 22, 1–42, (1997).
Nesterov, Y. E. and M. J. Todd. “Primal-dual interior-point methods for self-scaled cones”. SIAM Journal on Optimization 8, 324–364, (1998).
Nesterov, Y. E., M. J. Todd and Y. Ye. “Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems”. Mathematical Programming 84, 227–267, (1999).
Nocedal, J. and S. J. Wright. Numerical Optimization. Springer-Verlag. New York, (1999).
Renegar, J. A Mathematical View of Interior-Point Methods in Convex Optimiza-tion. SIAM. Philadelphia, (2001).
Wills, A. G. Barrier Function Based Model Predictive Control. PhD thesis. School of Electrical Engineering and Computer Science, University of Newcastle, Aus-tralia, (2003).
Wills, A. G., Heath, W. P., “Barrier function based model predictive control”, Automatica., 40, 1415–1422, (2004).
Wills, A. G., Heath, W. P., “Application of barrier function based model predictive control to an edible oil refining process”, Journal of Process Control., 15, 183–200, (2005).
Zillober, C, and K. Schittkowski and K. Moritzen. “Very large scale optimiza-tion by sequential convex programming”. Optimization Methods and Software 19(1), 103–120, (2004).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wills, A.G., Heath, W.P. (2007). Interior-Point Algorithms for Nonlinear Model Predictive Control. In: Findeisen, R., Allgöwer, F., Biegler, L.T. (eds) Assessment and Future Directions of Nonlinear Model Predictive Control. Lecture Notes in Control and Information Sciences, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72699-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-72699-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72698-2
Online ISBN: 978-3-540-72699-9
eBook Packages: EngineeringEngineering (R0)