Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC
From MaRDI portal
(Redirected from Publication:2989596)
Recommendations
- Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method
- Complexity certifications of first-order inexact Lagrangian methods for general convex programming: application to real-time MPC
- Computational complexity certification for dual gradient method: application to embedded MPC
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers
- On the iterative complexity of the linearized alternating direction method of multipliers
- Optimally linearizing the alternating direction method of multipliers for convex programming
- A Unifying Complexity Certification Framework for Active-Set Methods for Convex Quadratic Programming
Cited in
(4)- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- Accelerated Alternating Projections for Robust Principal Component Analysis
- Fast \(l_1\) model predictive control based on sensitivity analysis strategy
- Fast algorithms for constrained generalised predictive control with on-line optimisation
This page was built for publication: Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989596)
