Towards computational complexity certification for constrained mpc based on lagrange relaxation and the fast gradient method

Solving a convex optimization problem within an a priori certified period of time is a challenging problem. This paper discusses the certification of Nesterov’s fast gradient method for problems with a strictly quadratic objective and a feasible set given as the intersection of a parametrized affine set and a convex set constraint. We derive a lower iteration bound for the solution of the dual problem that is obtained from a partial Lagrange Relaxation and propose a new constant step- size rule that we prove to be optimal under mild assumptions. Finally, the certification procedure is applied to a constrained MPC problem and it is shown that the new step-size rule improves convergence significantly.

Publié dans:
Proceedings of the IEEE Conference on Decision & Control
Présenté à:
IEEE Conference on Decision & Control, Orlando, Florida, December, 2011

 Notice créée le 2011-10-24, modifiée le 2018-09-13

Évaluer ce document:

Rate this document:
(Pas encore évalué)