A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic

DOI10.1016/J.AUTOMATICA.2015.03.002zbMath1377.93067OpenAlexW2035899642MaRDI QIDQ1689378

Alberto Bemporad, Alberto Guiggiani, Panagiotis Patrinos

Publication date: 12 January 2018

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2015.03.002

zbMATH Keywords

convex optimizationembedded systemspredictive controlfixed-point hardware

Mathematics Subject Classification ID

Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Related Items (5)

Reference and command governors for systems with constraints: A survey on theory and applications ⋮ Local Decay of Residuals in Dual Gradient Method with Soft State Constraints ⋮ FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming ⋮ Augmented Lagrangian optimization under fixed-point arithmetic ⋮ Soft inequality constraints in gradient method and fast gradient method for quadratic programming

Uses Software

• fast_mpc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Introductory lectures on convex optimization. A basic course.
• An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Smooth Optimization with Approximate Gradient
• Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC

This page was built for publication: A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic