Computational complexity certification for dual gradient method: application to embedded MPC
From MaRDI portal
Publication:894005
DOI10.1016/j.sysconle.2015.04.011zbMath1330.49033OpenAlexW929521247MaRDI QIDQ894005
Publication date: 23 November 2015
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2015.04.011
complexity certificationdual gradientembedded model predictive controllinear/sublinear convergence rate
Optimality conditions and duality in mathematical programming (90C46) Complexity and performance of numerical algorithms (65Y20)
Related Items
Linear complementarity model predictive control with limited iterations for box-constrained problems, Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs, Iteration complexity analysis of dual first-order methods for conic convex programming, Real-time model predictive control based on dual gradient projection: Theory and fixed-point FPGA implementation, A software framework for embedded nonlinear model predictive control using a gradient-based augmented Lagrangian approach (GRAMPC)
Cites Work
- Accelerated gradient methods and dual decomposition in distributed model predictive control
- An auto-generated real-time iteration algorithm for nonlinear MPC in the microsecond range
- Interior-point Lagrangian decomposition method for separable convex optimization
- Introductory lectures on convex optimization. A basic course.
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems
- Application of interior-point methods to model predictive control
- Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Variational Analysis
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC
- Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method