An Accelerated Proximal Gradient-based Model Predictive Control Algorithm

preprint2022arXivOpen access

Abstract

In this letter, an accelerated quadratic programming (QP) algorithm is proposed based on the proximal gradient method. The algorithm can achieve convergence rate O(1/pα)O(1/p^α), where pp is the iteration number and αα is the given positive integer. The proposed algorithm improves the convergence rate of existing algorithms that achieve O(1/p2)O(1/p^{2}). The key idea is that iterative parameters are selected from a group of specific high order polynomial equations. The performance of the proposed algorithm is assessed on the randomly generated model predictive control (MPC) optimization problems. The experimental results show that our algorithm can outperform the state-of-the-art optimization software MOSEK and ECOS for the small size MPC problems.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.