Efficient active set optimization in triple mode MPC

DOI10.1109/9.940940zbMATH Open1010.93045OpenAlexW2135522806MaRDI QIDQ4540470FDOQ4540470

Authors Mark Cannon, J. Rossiter, Basil Kouvaritakis

Publication date 21 July 2002

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.940940

zbMATH Keywords

model predictive controlleast squares problemNewton-Raphson methodquadratic programsequality problemactive linear constraintsconstrained QP

Mathematics Subject Classification ID

Quadratic programming (90C20) Newton-type methods (49M15) Design techniques (robust design, computer-aided design, etc.) (93B51)

Recommendations

• A fast MPC algorithm using nonfeasible active set methods
• An online active set strategy to overcome the limitations of explicit MPC
• Computationally efficient algorithms for constraint handling with guaranteed stability and near optimality
• Robust triple mode MPC
• An active set quadratic programming algorithm for real-time model predictive control

Cited in

(14)

• scientific article; zbMATH DE number 1445435 (Why is no real title available?)
• Squaring the circle: an algorithm for generating polyhedral invariant sets from ellipsoidal ones
• New formulation of robust MPC by incorporating off-line approach with on-line optimization
• Robust triple mode MPC
• Dominant speed factors of active set methods for fast MPC
• An online active set strategy to overcome the limitations of explicit MPC
• More efficient predictive control
• Control of constrained linear systems using fast sampling rates
• Fast, large-scale model predictive control by partial enumeration
• Computationally efficient algorithms for constraint handling with guaranteed stability and near optimality
• scientific article; zbMATH DE number 6907388 (Why is no real title available?)
• An active set quadratic programming algorithm for real-time model predictive control
• Power-constrained intermittent control
• A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme

This page was built for publication: Efficient active set optimization in triple mode MPC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540470)