Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC

DOI10.1109/TAC.2016.2561407MaRDI QIDQ2989596zbMATH OpenOpenAlexFDO

Authors Ye Pu, Melanie N. Zeilinger, Colin N. Jones

Publication date 8 June 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2016.2561407

Mathematics Subject Classification ID

Convex programming (90C25) Analysis of algorithms and problem complexity (68Q25)

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

(3)

• Certification aspects of the fast gradient method for solving the dual of parametric convex programs
• Fast \(l_1\) model predictive control based on sensitivity analysis strategy
• Accelerated Alternating Projections for Robust Principal Component Analysis

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)