Toward Improved Performance of Inner Convex Approximation for Suboptimal Nonlinear MPC

Inner convex approximation is a compelling method that enables the real-time implementation of suboptimal nonlinear model predictive controls (MPCs). However, it suffers from a slow convergence rate, which prevents suboptimal MPC from achieving better performance within a specific sample time. To address this issue, we first reformulate the conventional inner convex approximation procedure as a root-finding problem for a nonlinear equation. Then, under mild assumptions, a comprehensive functional analysis is performed on the derived nonlinear equation, focusing on its continuity, differentiability, and the invertibility of the Jacobian matrix. Building on this analysis, we propose an improved algorithm that applies Broyden’s method to accelerate the root-finding procedure of this derived nonlinear equation, thereby enhancing the convergence rate of the conventional inner convex approximation method. We also provide a detailed analysis of the proposed algorithm’s convergence properties and computational complexity, showing that it achieves a locally superlinear convergence rate without devoting much additional computational effort. Simulation experiments are performed in an obstacle avoidance scenario, and the results are compared to the conventional inner convex approximation method to assess the effectiveness and advantages of the proposed approach.